On graphs with disjoint dominating and 2-dominating sets
From MaRDI portal
Publication:2866456
DOI10.7151/dmgt.1652zbMath1291.05144OpenAlexW2068273404MaRDI QIDQ2866456
Michael A. Henning, Douglas F. Rall
Publication date: 13 December 2013
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1652
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Graphs with disjoint 2-dominating sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Certified domination ⋮ An explicit construction of optimal dominating and [1, 2–dominating sets in grid] ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ Spanning trees with disjoint dominating and 2-dominating sets
This page was built for publication: On graphs with disjoint dominating and 2-dominating sets