Subgroup total perfect codes in Cayley sum graphs
From MaRDI portal
Publication:6591963
DOI10.1007/S10623-024-01405-XMaRDI QIDQ6591963
Could not fetch data.
Publication date: 23 August 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total perfect codes in Cayley graphs
- Efficient open domination in Cayley graphs
- Perfect domination sets in Cayley graphs
- Subgroup perfect codes in Cayley sum graphs
- Efficient dominating sets in Cayley graphs.
- Perfect codes in Cayley sum graphs
- Subgroup regular sets in Cayley graphs
- On subgroup perfect codes in Cayley graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Lattice-like total perfect codes
- Regular sets in Cayley graphs
- Independent perfect domination sets in Cayley graphs
- Representations and characters of groups.
- Diameters and Eigenvalues
- Perfect Codes in Cayley Graphs
- On Cayley sum graphs of non-abelian groups
- On subgroup perfect codes in Cayley sum graphs
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- On regular sets in Cayley graphs
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)
