scientific article; zbMATH DE number 5531984

MaRDI QIDQ3615799zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi, L. R. Markus, Renu C. Laskar, Peter Slater

Publication date 24 March 2009

zbMATH Keywords

disjoint dominating setsdisjoint domination numberdomination

Mathematics Subject Classification ID

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

Recommendations

• Disjoint dominating and total dominating sets in graphs
• Disjoint dominating and 2-dominating sets in graphs
• A note on disjoint dominating sets in graphs
• Graphs with disjoint dominating and paired-dominating sets
• Graphs with disjoint 2-dominating sets
• On graphs with disjoint dominating and 2-dominating sets
• scientific article; zbMATH DE number 1229626
• On disjunctive domination in graphs
• A characterization of graphs with disjoint total dominating sets
• Disjunctive total domination in graphs

Cited in

(25)

• Disjoint minimal graphs
• Remarks about disjoint dominating sets
• The even adjacency split problem for graphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• Pairs of disjoint dominating sets in connected cubic graphs
• Pairs of disjoint dominating sets and the minimum degree of graphs
• Disjoint dominating and 2-dominating sets in graphs
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• Rainbow domination and related problems on strongly chordal graphs
• Minimal graphs with disjoint dominating and paired-dominating sets
• A note on disjoint dominating sets in graphs
• Algorithmic aspects of disjunctive domination in graphs
• Domination and total domination in hypergraphs
• Finding dominators via disjoint set union
• scientific article; zbMATH DE number 1229626 (Why is no real title available?)
• Graphs with constant sum of domination and inverse domination numbers
• On disjoint maximal independent sets in graphs
• Disjoint dominating sets with a perfect matching
• Some results for the two disjoint connected dominating sets problem
• Disjoint dominating and total dominating sets in graphs
• Algorithmic aspects of paired disjunctive domination in graphs
• Dominating and total dominating partitions in cubic graphs
• Dual-server domination in graphs
• Disjoint dominating and 2-dominating sets in graphs: hardness and approximation results
• Complexity of (p, q)-bipartition of planar and 1-planar graphs

This page was built for publication:

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