Remarks about disjoint dominating sets

DOI10.1016/j.disc.2009.06.017zbMath1189.05130OpenAlexW2067903698MaRDI QIDQ1045182

Christian Löwenstein, Michael A. Henning, Dieter Rautenbach

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00014261/IfM_Preprint_M_08_09.pdf

zbMATH Keywords

independencedominationinverse domination

Mathematics Subject Classification ID

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

Related Items (20)

On graphs admitting two disjoint maximum independent sets ⋮ A note on non-dominating set partitions in graphs ⋮ Graphs with disjoint 2-dominating sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Disjoint dominating and total dominating sets in graphs ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ Disjoint dominating sets with a perfect matching ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ On disjoint maximal independent sets in graphs ⋮ Dominating and total dominating partitions in cubic graphs ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ On graph fall-coloring: existence and constructions ⋮ Complexity of fall coloring for restricted graph classes ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ Spanning trees with disjoint dominating and 2-dominating sets ⋮ 1-well-covered graphs revisited ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees ⋮ Elimination properties for minimal dominating sets of graphs

Cites Work

• On minimum dominating sets with minimum intersection
• Inverse domination in graphs
• On minimum intersection of two minimum dominating sets of interval graphs
• Trees with two disjoint minimum independent dominating sets
• Towards a theory of domination in graphs
• Approximating theDomatic Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Remarks about disjoint dominating sets