Efficient dominating sets in circulant graphs

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

zbMATH Keywords

Cayley graphscirculant graphsefficient dominating sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

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

Cites work

• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• Efficient dominating sets in Cayley graphs.
• Efficient dominating sets in circulant graphs with domination number prime
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• Efficient domination in cubic vertex-transitive graphs
• Independent perfect domination sets in Cayley graphs
• Perfect codes in circulant graphs
• Perfect codes in graphs
• Perfect codes over graphs
• Subgroups as efficient dominating sets in Cayley graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Worst-case efficient dominating sets in digraphs

Cited in

(33)

• Efficient dominating sets in Cayley graphs.
• Cyclotomic graphs and perfect codes
• Independent perfect domination sets in semi-Cayley graphs
• Efficient domination in Cayley graphs of generalized dihedral groups
• Characterizing subgroup perfect codes by 2-subgroups
• Classification of efficient dominating sets of circulant graphs of degree 5
• Existence of efficient total dominating sets of circulant graphs of degree 4
• Regular sets in circulant graphs with degree 3
• Independent perfect dominating sets in semi-Cayley graphs
• Subgroup perfect codes in Cayley sum graphs
• Perfect codes in Cayley graphs
• Perfect codes in vertex-transitive graphs
• Perfect codes in circulant graphs
• Perfect codes in 2-valent Cayley digraphs on abelian groups
• On regular sets in Cayley graphs
• Efficient dominating sets in circulant graphs with domination number prime
• Efficient 2-domination number in circulant graphs
• scientific article; zbMATH DE number 637297 (Why is no real title available?)
• Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
• Efficient generation of all regular non-dominated coteries
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• Subgroups as efficient dominating sets in Cayley graphs
• Perfect codes in Cayley sum graphs
• Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
• Constructing dominating sets in circulant graphs
• Subgroup Perfect Codes in Cayley Graphs
• Efficient dominating sets in circulant graphs
• The fullerene graphs with a perfect star packing
• Efficient open domination in Cayley graphs
• On subgroup perfect codes in Cayley graphs
• Characterization of subgroup perfect codes in Cayley graphs
• On subgroup perfect codes in Cayley sum 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)