q-coverings, codes and line graphs

DOI10.1016/0095-8956(81)90088-5zbMath0386.05046OpenAlexW1976767461MaRDI QIDQ1249589

Peter Hammond

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90088-5

zbMATH Keywords

coveringscodesline graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (3)

Partitions and fuzziness ⋮ On perfect codes in Cartesian products of graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two infinite classes of perfect codes in metrically regular graphs
• Polarities of generalized hexagons and perfect codes
• Homological Coverings of Graphs
• DESIGNS, FACTORS AND CODES IN GRAPHS
• A new 5‐arc‐transitive cubic graph

This page was built for publication: q-coverings, codes and line graphs