Perfect codes in Cayley graphs
From MaRDI portal
Publication:4604646
DOI10.1137/17M1129532zbMATH Open1381.05032arXiv1609.03755MaRDI QIDQ4604646FDOQ4604646
Authors: He Huang, Binzhou Xia, Sanming Zhou 
Publication date: 5 March 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Abstract: Given a graph , a subset of is called a perfect code in if every vertex of is at distance no more than one to exactly one vertex in , and a subset of is called a total perfect code in if every vertex of is adjacent to exactly one vertex in . In this paper we study perfect codes and total perfect codes in Cayley graphs, with a focus on the following themes: when a subgroup of a given group is a (total) perfect code in a Cayley graph of the group; and how to construct new (total) perfect codes in a Cayley graph from known ones using automorphisms of the underlying group. We prove several results around these questions.
Full work available at URL: https://arxiv.org/abs/1609.03755
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- Perfect Codes for Metrics Induced by Circulant Graphs
- Title not available (Why is that?)
- Perfect codes in the graphs \(O_k\)
- Efficient domination in circulant graphs
- Title not available (Why is that?)
- On the norm of a group
- Perfect codes over graphs
- 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
- Perfect codes in \(\mathrm{SL}(2,2^f)\)
- Independent perfect domination sets in Cayley graphs
- Total perfect codes in Cayley graphs
- Perfect codes in the graphs Ok and L(Ok)
- Perfect Codes From Cayley Graphs Over Lipschitz Integers
- Perfect codes in circulant graphs
- Perfect codes and regular partitions in graphs and groups
- A survey of perfect codes
- A survey of perfect codes
- Efficient domination in circulant graphs with two chord lengths
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Factoring groups into subsets.
- Power automorphisms of a group
- Efficient dominating sets in circulant graphs
- Full Rank Tilings of Finite Abelian Groups
- Factoring Finite Abelian Groups by Subsets with Maximal Span
- Quotients of Gaussian graphs and their application to perfect codes
Cited In (37)
- On subgroup regular sets in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Title not available (Why is that?)
- On the subgroup perfect codes in Cayley graphs
- On non-normal subgroup perfect codes
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Perfect codes in \(m\)-Cayley hypergraphs
- Regular sets in circulant graphs with degree 3
- Perfect Codes From Cayley Graphs Over Lipschitz Integers
- Perfect t-codes in Cayley graphs of groups
- Subgroup Perfect Codes in Cayley Graphs
- Parameterized complexity of minimum membership dominating set
- Total perfect codes in Cayley graphs
- On subgroup perfect codes in Cayley sum graphs
- A NOTE ON REGULAR SETS IN CAYLEY 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
- Neighbour-transitive codes in Kneser graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Subgroup perfect codes in Cayley sum graphs
- On regular sets in Cayley graphs
- Characterizing subgroup perfect codes by 2-subgroups
- Corrigendum to: ``On subgroup perfect codes in Cayley graphs
- Cyclotomic graphs and perfect codes
- Perfect codes in vertex-transitive graphs
- Perfect codes in commuting graphs of symmetric groups
- Regular sets in Cayley sum graphs
- On connected components and perfect codes of proper order graphs of finite groups
- Perfect codes in Cayley sum graphs
- An infinite class of Neumaier graphs and non-existence results
- Regular sets in Cayley graphs
- On subgroup perfect codes in Cayley graphs
- Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs
- Some codes in symmetric and linear groups
This page was built for publication: Perfect codes in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604646)
