On subgroup perfect codes in Cayley sum graphs
Author:
- 22 February 2024
- journal article
- research article
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 95
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Efficient dominating sets in circulant graphsDiscrete Mathematics, 2017
- Total perfect codes in Cayley graphsDesigns, Codes and Cryptography, 2016
- On Cayley Sum Graphs of Non-Abelian GroupsGraphs and Combinatorics, 2015
- Subgroups as efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2013
- Sums and differences along Hamiltonian cyclesDiscrete Mathematics, 2010
- Connectivity of addition Cayley graphsJournal of Combinatorial Theory, Series B, 2009
- Efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2003
- Independent perfect domination sets in Cayley graphsJournal of Graph Theory, 2001
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973