On regular sets in Cayley graphs
From MaRDI portal
Publication:6491172
DOI10.1007/S10801-024-01298-YMaRDI QIDQ6491172
Sanming Zhou, Shou-Jun Xu, Xiaomeng Wang
Publication date: 24 April 2024
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect 2-colorings of the generalized Petersen graph
- 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
- Enumerating and decoding perfect linear Lee codes
- Perfect domination sets in Cayley graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient dominating sets in Cayley graphs.
- Efficient domination in circulant graphs
- Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
- Subgroup regular sets in Cayley graphs
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Regular sets in Cayley graphs
- Independent perfect domination sets in Cayley graphs
- Perfect Codes for Metrics Induced by Circulant Graphs
- Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups
- 50 Years of the Golomb--Welch Conjecture
- Perfect Codes in Cayley Graphs
- Error Detecting and Error Correcting Codes
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- On non-normal subgroup perfect codes
- Equitable partitions of Latin‐square graphs
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- A survey of perfect codes
- Perfect 2‐colorings of Hamming graphs
This page was built for publication: On regular sets in Cayley graphs
