Disjoint dominating and 2-dominating sets in graphs
classification
🧮 math.CO
keywords
dominatingdisjointgraphgraphssetscharacterizationsconcerninghardness
read the original abstract
A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning $D\!D_2$-graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.