On the subgroup perfect codes in Cayley graphs
From MaRDI portal
Publication:2678977
DOI10.1007/S10623-022-01098-0zbMath1506.05090OpenAlexW4292791005MaRDI QIDQ2678977
Behrooz Khosravi, Zeinab Akhlaghi, Yasamin Khaefi
Publication date: 18 January 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01098-0
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (1)
Cites Work
- Unnamed Item
- Total perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Efficient dominating sets in Cayley graphs.
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Independent perfect domination sets in Cayley graphs
- Perfect Codes in Cayley Graphs
- Subgroup Perfect Codes in Cayley Graphs
This page was built for publication: On the subgroup perfect codes in Cayley graphs