Spanning Trees with Disjoint Dominating and 2-Dominating Sets
In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.
Main Authors: | Miotk Mateusz, Żyliński Paweł |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2258 |
Similar Items
-
Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets
by: Henning Michael A., et al.
Published: (2021-08-01) -
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
by: Henning Michael A., et al.
Published: (2016-02-01) -
An improved upper bound on the independent double Roman domination number of trees
by: F. Nahani Pour, et al.
Published: (2022-09-01) -
Reconfiguring Minimum Dominating Sets: The γ-Graph of a Tree
by: Edwards Michelle, et al.
Published: (2018-08-01) -
Domination Subdivision and Domination Multisubdivision Numbers of Graphs
by: Dettlaff Magda, et al.
Published: (2019-11-01)