A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

DOI10.2989/QM.2009.32.1.10.712MaRDI QIDQ3638240zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Justin Southey

Publication date 2 July 2009

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/qm.2009.32.1.10.712

zbMATH Keywords

dominationtotal dominationvertex partition

Mathematics Subject Classification ID

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

Recommendations

• A characterization of graphs with disjoint dominating and paired-dominating sets
• A characterization of graphs with disjoint total dominating sets
• A note on graphs with disjoint dominating and total dominating sets
• Disjoint dominating and total dominating sets in graphs
• Partitioning the vertices of a graph into two total dominating sets

Cited in

(20)

• Disjoint dominating and 2-dominating sets in graphs
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• Minimal graphs with disjoint dominating and paired-dominating sets
• A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
• A note on graphs with disjoint dominating and total dominating sets
• A characterization of graphs with disjoint total dominating sets
• Partitioning the vertices of a graph into two total dominating sets
• Total domination in digraphs
• Independent set dominating sets in bipartite graphs
• Disjoint dominating and total dominating sets in graphs
• Graphs with disjoint dominating and paired-dominating sets
• Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
• Dominating and total dominating partitions in cubic graphs
• A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
• Reducing regular graphs to partition their vertices into a total dominating set and an independent dominating set
• Minimal graphs with disjoint dominating and total dominating sets
• Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set
• A characterization of graphs with disjoint dominating and paired-dominating sets

This page was built for publication: A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

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