On subgroup perfect codes in Cayley sum graphs
From MaRDI portal
Publication:6191098
DOI10.1016/j.ffa.2024.102393arXiv2210.03336OpenAlexW4392076995MaRDI QIDQ6191098
Publication date: 6 March 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.03336
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Total perfect codes in Cayley graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs
- Perfect codes in circulant graphs
- Subgroup perfect codes in Cayley sum graphs
- Efficient dominating sets in Cayley graphs.
- The theory of finite groups. An introduction.
- Cyclotomic graphs and perfect codes
- Perfect codes in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Connectivity of addition Cayley graphs
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- Diameters and Eigenvalues
- Perfect Codes in Cayley Graphs
- Subgroup Perfect Codes in Cayley Graphs
- Sums and differences along Hamiltonian cycles
- A survey of perfect codes
- On Cayley sum graphs of non-abelian groups
- Characterizing subgroup perfect codes by 2-subgroups
This page was built for publication: On subgroup perfect codes in Cayley sum graphs
