Some Algorithmic Results on Restrained Domination in Graphs

Arti Pandey, B. S. Panda

A set $D\subseteq V$ of a graph $G=(V,E)$ is called a restrained dominating set of $G$ if every vertex not in $D$ is adjacent to a vertex in $D$ and to a vertex in $V\setminus D$.…