Efficient dominating sets in circulant graphs
From MaRDI portal
Publication:526230
DOI10.1016/J.DISC.2017.02.014zbMATH Open1361.05094OpenAlexW2601975834MaRDI QIDQ526230FDOQ526230
Authors: Yun-Ping Deng, Yu-Qin Sun, Qiong Liu, Haichao Wang 
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.02.014
Recommendations
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient dominating sets in circulant graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient 2-domination number in circulant graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Perfect codes in graphs
- Title not available (Why is that?)
- Efficient domination in circulant graphs
- Perfect codes over graphs
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- Perfect codes in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Worst-case efficient dominating sets in digraphs
Cited In (29)
- Characterization of subgroup perfect codes in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
- Efficient domination in Cayley graphs of generalized dihedral groups
- Efficient 2-domination number in circulant graphs
- Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
- The fullerene graphs with a perfect star packing
- Perfect Codes in Cayley Graphs
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Efficient open domination in Cayley graphs
- Regular sets in circulant graphs with degree 3
- Subgroup Perfect Codes in Cayley Graphs
- On subgroup perfect codes in Cayley sum graphs
- Independent perfect domination sets in semi-Cayley graphs
- Independent perfect dominating sets in semi-Cayley graphs
- Perfect codes in circulant graphs
- Title not available (Why is that?)
- Efficient domination in circulant graphs with two chord lengths
- Efficient generation of all regular non-dominated coteries
- Subgroup perfect codes in Cayley sum graphs
- On regular sets in Cayley graphs
- Characterizing subgroup perfect codes by 2-subgroups
- Efficient dominating sets in Cayley graphs.
- Cyclotomic graphs and perfect codes
- Perfect codes in vertex-transitive graphs
- Efficient domination in circulant graphs
- Perfect codes in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- Subgroups as efficient dominating sets in Cayley graphs
This page was built for publication: Efficient dominating sets in circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526230)
