Perfect Codes in Cayley Graphs
From MaRDI portal
Publication:4604646
DOI10.1137/17M1129532zbMath1381.05032arXiv1609.03755MaRDI QIDQ4604646
Binzhou Xia, He Huang, Sanming Zhou
Publication date: 5 March 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.03755
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items
Cyclotomic graphs and perfect codes, Perfect t-codes in Cayley graphs of groups, Classification of efficient dominating sets of circulant graphs of degree 5, Subgroup regular sets in Cayley graphs, Some codes in symmetric and linear groups, Characterizing subgroup perfect codes by 2-subgroups, On the subgroup perfect codes in Cayley graphs, Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs, On non-normal subgroup perfect codes, Perfect codes in vertex-transitive graphs, On subgroup perfect codes in Cayley sum graphs, A NOTE ON REGULAR SETS IN CAYLEY GRAPHS, Neighbour-transitive codes in Kneser graphs, Regular sets in Cayley graphs, Subgroup Perfect Codes in Cayley Graphs, Perfect codes in proper reduced power graphs of finite groups, On subgroup perfect codes in Cayley graphs, On codes in the projective linear group \(\mathrm{PGL}(2,q)\), Perfect codes in circulant graphs, Parameterized complexity of minimum membership dominating set, Characterization of subgroup perfect codes in Cayley graphs, Corrigendum to: ``On subgroup perfect codes in Cayley graphs, Perfect codes in Cayley sum graphs, Subgroup perfect codes in Cayley sum graphs, An infinite class of Neumaier graphs and non-existence results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total perfect codes in Cayley graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient dominating sets in circulant graphs
- Perfect codes in circulant graphs
- Perfect codes and regular partitions in graphs and groups
- On the norm of a group
- Efficient domination in circulant graphs with two chord lengths
- Quotients of Gaussian graphs and their application to perfect codes
- 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 the graphs \(O_k\)
- Perfect codes in \(\mathrm{SL}(2,2^f)\)
- Efficient domination in circulant graphs
- Power automorphisms of a group
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- Perfect Codes for Metrics Induced by Circulant Graphs
- Perfect codes in the graphs Ok and L(Ok)
- Perfect Codes From Cayley Graphs Over Lipschitz Integers
- Factoring Finite Abelian Groups by Subsets with Maximal Span
- Full Rank Tilings of Finite Abelian Groups
- A survey of perfect codes
- A survey of perfect codes
