Some results on perfect codes in Cayley sum graphs
Preprint
Abstract
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- On subgroup perfect codes in Cayley sum graphsFinite Fields and Their Applications, 2024
- On subgroup perfect codes in Cayley graphsEuropean Journal of Combinatorics, 2021
- Characterization of subgroup perfect codes in Cayley graphsDiscrete Mathematics, 2020
- Subgroup perfect codes in Cayley sum graphsDesigns, Codes and Cryptography, 2020
- Cyclotomic graphs and perfect codesJournal of Pure and Applied Algebra, 2019
- On Cayley Sum Graphs of Non-Abelian GroupsGraphs and Combinatorics, 2015
- Efficient domination in cubic vertex-transitive graphsEuropean Journal of Combinatorics, 2012
- Sums and differences along Hamiltonian cyclesDiscrete Mathematics, 2010
- Connectivity of addition Cayley graphsJournal of Combinatorial Theory, Series B, 2009
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973