Algorithmic aspects of disjunctive domination in graphs

B. S. Panda, Arti Pandey, S. Paul

For a graph $G=(V,E)$, a set $D\subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v\in V\setminus D$, $v$ is either adjacent to a vertex of $D$…