论文信息 - q-Coverings, codes, and line graphs

q-Coverings, codes, and line graphs

Abstract In this paper we consider the relationship between q -coverings of a regular graph and perfect 1-codes in line graphs. An infinite class of perfect 1-codes in the line graphs L ( I k ) is constructed.

Peter Hammond | P. Hammond

[1] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[2] Norman Biggs,et al. DESIGNS, FACTORS AND CODES IN GRAPHS , 1975 .

[3] Joseph A. Thas. Two infinite classes of perfect codes in metrically regular graphs , 1977, J. Comb. Theory, Ser. B.

[4] Peter J. Cameron,et al. Polarities of generalized hexagons and perfect codes , 1976 .

[5] N. Biggs. Combinatorics: Perfect codes and distance-transitive graphs , 1974 .