On the Complexity of Co-secure Dominating Set Problem

B S Panda, Soumyashree Rana, Sounaka Mishra

A set $D\subseteq V$ of a graph $G=(V,E)$ is a dominating set of $G$ if every vertex $v\in V\setminus D$ is adjacent to at least one vertex in $D.$ A set $S\subseteq V$ is a co-…