Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs

zbMATHMaRDI QIDQ3374664FDO

Authors Tian-Chuan Sun, Min Zhao, Liying Kang

Publication date 9 March 2006

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Efficient dominating sets in circulant graphs
• Efficient dominating sets in circulant graphs
• Efficient dominating sets in circulant graphs with domination number prime
• Classification of efficient dominating sets of circulant graphs of degree 5
• Efficient domination in circulant graphs

Cited in

(6)

• Classification of efficient dominating sets of circulant graphs of degree 5
• Partially balanced incomplete block designs arising from minimum efficient dominating sets of a graph
• SSP-cyclic structure of some circulant graphs
• Efficient domination in circulant graphs
• Efficient domination in Mycielski's graphs
• Efficient dominating sets in circulant graphs

This page was built for publication: Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374664)