An improved version of Lloyd's theorem

DOI10.1016/0012-365X(76)90083-2zbMath0331.94004OpenAlexW2033441031MaRDI QIDQ1227561

K. Appert

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(76)90083-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\) ⋮ Total perfect codes in Cayley graphs ⋮ Perfect codes in vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly perfect codes in distance-regular graphs
• Perfect codes in the graphs \(O_k\)
• Perfect codes in graphs
• Antipodal covering graphs
• Perfect Codes in Antipodal Distance-Transitive Graphs.
• An algebraic study of group and nongroup error-correcting codes
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• A new 5‐arc‐transitive cubic graph

This page was built for publication: An improved version of Lloyd's theorem