Total perfect codes in Cayley graphs

DOI10.1007/S10623-015-0169-0zbMATH Open1347.05097arXiv1601.03471OpenAlexW3099058551MaRDI QIDQ329192FDOQ329192

Authors: Sanming Zhou 

Publication date: 21 October 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1601.03471

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 1-perfect codes in Sierpiński graphs
• Perfect codes in graphs
• Perfect Codes for Metrics Induced by Circulant Graphs
• Perfect domination in regular grid graphs
• Title not available (Why is that?)
• Total perfect codes in tensor products of graphs.
• Title not available (Why is that?)
• On perfect codes and related concepts
• Perfect codes in the graphs \(O_k\)
• Efficient domination in circulant graphs
• 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 \(\mathrm{SL}(2,2^f)\)
• Lattice-like total perfect codes
• Odd neighborhood transversals on grid graphs
• Independent perfect domination sets in Cayley graphs
• Efficient open domination in graph products
• Title not available (Why is that?)
• Perfect codes in direct products of cycles
• Perfect codes in the graphs O_k and L(O_k)
• Perfect Codes in Antipodal Distance-Transitive Graphs.
• Perfect codes on the towers of Hanoi graph
• Efficient domination in cubic vertex-transitive graphs
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• Product Constructions for Perfect Lee Codes
• Total perfect codes in grid graphs
• Title not available (Why is that?)
• Perfect codes and regular partitions in graphs and groups
• A survey of perfect codes
• A survey of perfect codes
• 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

Cited In (28)

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

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)