A note on disjoint dominating sets in graphs

zbMATH Open1255.05129MaRDI QIDQ3145697FDOQ3145697

Authors:

Publication date: 21 December 2012

Full work available at URL: http://www.m-hikari.com/ijcms/ijcms-2012/41-44-2012/index.html

Recommendations

• scientific article; zbMATH DE number 5531984
• On disjunctive domination in graphs
• Disjunctive domination in graphs with minimum degree at least two
• Disjoint dominating and total dominating sets in graphs
• Domination versus disjunctive domination in trees

zbMATH Keywords

disjoint domination number\(\gamma \gamma \)-maximum\(\gamma \gamma \)-minimumdisjoint independent domination number

Mathematics Subject Classification ID

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

Cited In (11)

• Elimination properties for minimal dominating sets of graphs
• A note on non-dominating set partitions in graphs
• Title not available (Why is that?)
• Domination parameters with number 2: interrelations and algorithmic consequences
• Pairs of disjoint dominating sets and the minimum degree of graphs
• A note on the interval function of a disconnected graph
• Disjoint dominating sets with a perfect matching
• Disjoint dominating and 2-dominating sets in graphs
• Minimal graphs with disjoint dominating and paired-dominating sets
• Spanning trees with disjoint dominating and 2-dominating sets
• Title not available (Why is that?)

This page was built for publication: A note on disjoint dominating sets in graphs

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