A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
From MaRDI portal
Publication:3638240
DOI10.2989/QM.2009.32.1.10.712zbMath1168.05348OpenAlexW1964765260MaRDI QIDQ3638240
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
Related Items
Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Disjoint dominating and total dominating sets in graphs ⋮ Graphs with disjoint dominating and paired-dominating sets ⋮ Dominating and total dominating partitions in cubic graphs ⋮ A characterization of graphs with disjoint dominating and paired-dominating sets ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Total domination in digraphs ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees
This page was built for publication: A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets