Subgroup total perfect codes in Cayley sum graphs
From MaRDI portal
Publication:6591963
DOI10.1007/S10623-024-01405-XMaRDI QIDQ6591963FDOQ6591963
Authors: Xiaomeng Wang, Lina Wei, S. J. Xu, Sanming Zhou 
Publication date: 23 August 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total perfect codes in tensor products of graphs.
- Diameters and Eigenvalues
- Efficient dominating sets in Cayley graphs.
- Perfect codes in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- Lattice-like total perfect codes
- Independent perfect domination sets in Cayley graphs
- Total perfect codes in Cayley graphs
- Title not available (Why is that?)
- Perfect codes in Cayley graphs
- Representations and characters of groups.
- On Cayley sum graphs of non-abelian groups
- Efficient open domination in Cayley graphs
- Perfect domination sets in Cayley graphs
- Regular sets in Cayley graphs
- Subgroup perfect codes in Cayley sum graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Subgroup regular sets in Cayley graphs
- On subgroup perfect codes in Cayley sum graphs
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- On regular sets in Cayley graphs
Cited In (2)
This page was built for publication: Subgroup total perfect codes in Cayley sum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591963)
