Classification of subgroup perfect codes in Cayley graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3724683 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 687687 (Why is no real title available?)
- scientific article; zbMATH DE number 708819 (Why is no real title available?)
- Characterization of subgroup perfect codes in Cayley graphs
- Characterizing subgroup perfect codes by 2-subgroups
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs
- Efficient domination in Cayley graphs of generalized dihedral groups
- Efficient domination in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Endliche Gruppen I
- Independent perfect domination sets in Cayley graphs
- On subgroup perfect codes in Cayley graphs
- On the subgroup perfect codes in Cayley graphs
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes over graphs
- Subgroup Perfect Codes in Cayley Graphs
This page was built for publication: Classification of subgroup perfect codes in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847634)