Regular sets in circulant graphs with degree 3
From MaRDI portal
Publication:6611005
DOI10.1016/J.DAM.2024.05.033zbMATH Open1547.05119MaRDI QIDQ6611005FDOQ6611005
Authors: Yuxia Hao, Xiaomeng Wang 
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Classification of efficient dominating sets of circulant graphs of degree 5
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient open domination in Cayley graphs
- Efficient dominating sets in circulant graphs
- Regular sets in Cayley graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Existence of efficient total dominating sets of circulant graphs of degree 4
- Subgroup regular sets in Cayley graphs
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- On regular sets in Cayley graphs
- On subgroup regular sets in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
This page was built for publication: Regular sets in circulant graphs with degree 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611005)
