Total perfect codes in Cayley graphs

DOI10.1007/S10623-015-0169-0MaRDI QIDQ329192zbMATH OpenOpenAlexFDO

Authors Sanming Zhou

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

zbMATH Keywords

Cayley graphefficient dominating setperfect codeefficient open dominating settotal perfect codetotal perfect dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: A total perfect code in a graph $Gamma$ is a subset $C$ of $V(Gamma)$ such that every vertex of $Gamma$ is adjacent to exactly one vertex in $C$. We give necessary and sufficient conditions for a conjugation-closed subset of a group to be a total perfect code in a Cayley graph of the group. As an application we show that a Cayley graph on an elementary abelian $2$-group admits a total perfect code if and only if its degree is a power of $2$. We also obtain necessary conditions for a Cayley graph of a group with connection set closed under conjugation to admit a total perfect code.

Recommendations

• Perfect codes in Cayley graphs
• Perfect codes in Cayley sum graphs
• Perfect \(t\)-codes in Cayley graphs of groups
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• Publication:4207865
• Publication:4892794
• Perfect codes in graphs
• Perfect codes in circulant graphs
• Subgroup Perfect Codes in Cayley Graphs
• On subgroup perfect codes in Cayley graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5080622 (Why is no real title available?)
• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• scientific article; zbMATH DE number 3266724 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• A survey of perfect codes
• A survey of perfect codes
• An improved version of Lloyd's theorem
• Codes and anticodes in the Grassman graph
• Cyclotomic graphs and perfect codes
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• Efficient domination in cubic vertex-transitive graphs
• Independent perfect domination sets in Cayley graphs
• Lattice-like total perfect codes
• Odd neighborhood transversals on grid graphs
• On perfect codes and related concepts
• On perfect codes in Cartesian products of graphs
• On perfect codes in the Hamming schemes H(n,q) with q arbitrary
• On the chromatic number of cube-like graphs
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• Perfect Codes for Metrics Induced by Circulant Graphs
• Perfect Codes in Antipodal Distance-Transitive Graphs.
• Perfect codes and regular partitions in graphs and groups
• Perfect codes in \(\mathrm{SL}(2,2^f)\)
• Perfect codes in direct products of cycles
• Perfect codes in direct products of cycles-a complete characterization
• Perfect codes in graphs
• Perfect codes in the graphs O_k and L(O_k)
• Perfect codes in the graphs \(O_k\)
• Perfect codes on the towers of Hanoi graph
• Perfect codes over graphs
• Perfect domination in regular grid graphs
• Product Constructions for Perfect Lee Codes
• Total perfect codes in grid graphs
• Total perfect codes in tensor products of graphs.

Cited in

(28)

• Total perfect codes in grid graphs
• Total perfect codes in tensor products of graphs.
• Perfect codes and universal adjacency spectra of commuting graphs of finite groups
• On subgroup regular sets in Cayley sum graphs
• Efficient domination in Cayley graphs of generalized dihedral groups
• Characterizing subgroup perfect codes by 2-subgroups
• Classification of efficient dominating sets of circulant graphs of degree 5
• Subgroup perfect codes in Cayley sum graphs
• Perfect codes in Cayley graphs
• Perfect codes in vertex-transitive graphs
• Total perfect codes in graphs realized by commutative rings
• Perfect codes in circulant graphs
• Subgroup total perfect codes in Cayley sum graphs
• Regular sets in Cayley graphs
• On codes in the projective linear group \(\mathrm{PGL}(2,q)\)
• Perfect codes in Cayley sum graphs
• Domination in rose window graphs
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• On the subgroup perfect codes in Cayley graphs
• Subgroup Perfect Codes in Cayley Graphs
• Lattice-like total perfect codes
• Perfect codes in proper order divisor graphs of finite groups
• Perfect codes in proper reduced power graphs of finite groups
• On subgroup perfect codes in Cayley graphs
• Graphs on groups in terms of the order of elements: a review
• Perfect codes in power graphs of finite groups
• On subgroup perfect codes in Cayley sum graphs
• Subgroup regular sets in Cayley graphs

This page was built for publication: Total perfect codes in Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329192)