Perfect codes in vertex-transitive graphs
From MaRDI portal
Publication:2689009
DOI10.1016/j.jcta.2023.105737OpenAlexW4318312436MaRDI QIDQ2689009
Publication date: 6 March 2023
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.06236
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) General theory for finite permutation groups (20B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total perfect codes in Cayley graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- Efficient dominating sets in circulant graphs
- Perfect codes in circulant graphs
- Perfect codes over graphs
- An improved version of Lloyd's theorem
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- Efficient dominating sets in Cayley graphs.
- The theory of finite groups. An introduction.
- Codes and anticodes in the Grassman graph
- Cyclotomic graphs and perfect codes
- Perfect codes in the graphs \(O_k\)
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- Vertex-transitive graphs: Symmetric graphs of prime valency
- Perfect codes in the graphs Ok and L(Ok)
- Perfect Codes in Antipodal Distance-Transitive Graphs.
- 50 Years of the Golomb--Welch Conjecture
- Perfect Codes in Cayley Graphs
- Perfect Codes and Related Structures
- Subgroup Perfect Codes in Cayley Graphs
- A survey of perfect codes
- A survey of perfect codes