Total perfect codes in Cayley graphs
From MaRDI portal
Publication:329192
DOI10.1007/s10623-015-0169-0zbMath1347.05097arXiv1601.03471OpenAlexW3099058551MaRDI QIDQ329192
Publication date: 21 October 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.03471
Cayley graphefficient dominating setperfect codeefficient open dominating settotal perfect codetotal perfect dominating set
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (18)
Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Classification of efficient dominating sets of circulant graphs of degree 5 ⋮ Subgroup regular sets in Cayley graphs ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Perfect codes in power graphs of finite groups ⋮ On the subgroup perfect codes in Cayley graphs ⋮ Perfect codes in vertex-transitive graphs ⋮ On subgroup perfect codes in Cayley sum graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Regular sets in Cayley graphs ⋮ Perfect codes in proper reduced power graphs of finite groups ⋮ On subgroup perfect codes in Cayley graphs ⋮ Domination in rose window graphs ⋮ Perfect codes in circulant graphs ⋮ Unnamed Item ⋮ Perfect codes in Cayley sum graphs ⋮ Subgroup perfect codes in Cayley sum graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient domination in cubic vertex-transitive graphs
- Perfect codes and regular partitions in graphs and groups
- On perfect codes in Cartesian products of graphs
- Efficient domination in circulant graphs with two chord lengths
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes over graphs
- On the chromatic number of cube-like graphs
- An improved version of Lloyd's theorem
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- Efficient dominating sets in Cayley graphs.
- Codes and anticodes in the Grassman graph
- Cyclotomic graphs and perfect codes
- Perfect codes in the graphs \(O_k\)
- Perfect codes in \(\mathrm{SL}(2,2^f)\)
- Efficient domination in circulant graphs
- Lattice-like total perfect codes
- Perfect codes in graphs
- Odd neighborhood transversals on grid graphs
- Independent perfect domination sets in Cayley graphs
- Open k-monopolies in graphs: complexity and related concepts
- Perfect codes in direct products of cycles
- Perfect Codes for Metrics Induced by Circulant Graphs
- Perfect codes in the graphs Ok and L(Ok)
- Perfect Codes in Antipodal Distance-Transitive Graphs.
- Perfect codes on the towers of Hanoi graph
- 1-perfect codes in Sierpiński graphs
- Perfect Codes From Cayley Graphs Over Lipschitz Integers
- Product Constructions for Perfect Lee Codes
- Perfect domination in regular grid graphs
- A survey of perfect codes
- A survey of perfect codes
- On perfect codes and related concepts
This page was built for publication: Total perfect codes in Cayley graphs
