Disjoint dominating and total dominating sets in graphs

DOI10.1016/J.DAM.2010.06.004zbMath1208.05099OpenAlexW2088380012MaRDI QIDQ602677

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

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.004

zbMATH Keywords

dominationvertex partitiontotal domination

Mathematics Subject Classification ID

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

Related Items (5)

Graphs with disjoint 2-dominating sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ A characterization of graphs with disjoint total dominating sets

Cites Work

• Remarks about disjoint dominating sets
• Inverse domination in graphs
• Pairs of disjoint dominating sets and the minimum degree of graphs
• Partitioning a graph into a dominating set, a total dominating set, and something else
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• Approximating theDomatic Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjoint dominating and total dominating sets in graphs