Efficient dominating sets in circulant graphs
From MaRDI portal
Publication:526230
DOI10.1016/j.disc.2017.02.014zbMath1361.05094OpenAlexW2601975834MaRDI QIDQ526230
Yu-Qin Sun, Yun-Ping Deng, Hai-Chao Wang, Qiong Liu
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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
Cyclotomic graphs and perfect codes ⋮ The fullerene graphs with a perfect star packing ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Independent perfect dominating sets in semi-Cayley graphs ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Perfect codes in vertex-transitive graphs ⋮ On subgroup perfect codes in Cayley sum graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ On subgroup perfect codes in Cayley graphs ⋮ Perfect codes in circulant graphs ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ Perfect codes in Cayley sum graphs ⋮ Subgroup perfect codes in Cayley sum graphs
Cites Work
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in cubic vertex-transitive graphs
- Perfect codes in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Perfect codes over graphs
- Efficient dominating sets in Cayley graphs.
- Efficient domination in circulant graphs
- Worst-case efficient dominating sets in digraphs
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- Unnamed Item
This page was built for publication: Efficient dominating sets in circulant graphs
