Perfect codes and regular partitions in graphs and groups

DOI10.1016/S0195-6698(87)80004-5zbMath0626.05051MaRDI QIDQ580375

Gwihen Etienne

Publication date: 1987

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

automorphism groupperfect coderegular partition of a graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Related Items (8)

Cyclotomic graphs and perfect codes ⋮ Regular codes in regular graphs are difficult ⋮ Total perfect codes in Cayley graphs ⋮ A Lloyd theorem in weakly metric association schemes ⋮ Some codes in symmetric and linear groups ⋮ Perfect Codes in Cayley Graphs ⋮ On codes in the projective linear group \(\mathrm{PGL}(2,q)\) ⋮ Perfect codes in circulant graphs

Cites Work

• A combinatorial problem in the symmetric group
• On Permutation Cliques
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect codes and regular partitions in graphs and groups