Graphs with disjoint 2-dominating sets
Preprint
Abstract
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a vertex or vertices in $D$. A graph $G$ is a $(2,2)$-dominated graph if it has a pair $(D,D')$ of disjoint $2$-dominating sets of vertices of $G$. In this paper we present two characterizations of minimal $(2,2)$-dominated graphs.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A characterization of graphs with disjoint total dominating setsArs Mathematica Contemporanea, 2019
- Spanning trees with disjoint 2 dominating and 2-dominating setsDiscussiones Mathematicae Graph Theory, 2019
- Bipartite spanning sub(di)graphs induced by 2‐partitionsJournal of Graph Theory, 2018
- On graphs with disjoint dominating and 2-dominating setsDiscussiones Mathematicae Graph Theory, 2013
- Disjoint dominating and total dominating sets in graphsDiscrete Applied Mathematics, 2010
- Partitioning a graph into a dominating set, a total dominating set, and something elseDiscussiones Mathematicae Graph Theory, 2010
- Remarks about disjoint dominating setsDiscrete Mathematics, 2009
- A characterization of graphs with disjoint dominating and paired-dominating setsJournal of Combinatorial Optimization, 2009