Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results

Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda

A set $D\subseteq V$ of a graph $G=(V,E)$ is a dominating set of $G$ if each vertex $v\in V\setminus D$ is adjacent to at least one vertex in $D,$ whereas a set $D_2\subseteq V$…