Perfect codes and regular partitions in graphs and groups

DOI10.1016/S0195-6698(87)80004-5zbMATH Open0626.05051MaRDI QIDQ580375FDOQ580375

Authors: Gwihen Etienne 

Publication date: 1987

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

Recommendations

• Publication:3032308
• Publication:4892794
• Characterization of subgroup perfect codes in Cayley graphs
• On subgroup perfect codes in Cayley graphs
• Characterizing subgroup perfect codes by 2-subgroups

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)

Cites Work

• Title not available (Why is that?)
• A combinatorial problem in the symmetric group
• On Permutation Cliques
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Partitions into perfect codes in the Hamming and Lee metrics
• Codes, transforms and the spectrum of the symmetric group
• Regular codes in regular graphs are difficult
• Partitions in finite geometry and related constant composition codes
• A Lloyd theorem in weakly metric association schemes
• Total perfect codes in Cayley graphs
• Perfect codes in circulant graphs
• On codes in the projective linear group \(\mathrm{PGL}(2,q)\)
• Title not available (Why is that?)
• Cyclotomic graphs and perfect codes
• Perfect codes in Cayley graphs
• Title not available (Why is that?)
• Some codes in symmetric and linear groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580375)