Complexity and Algorithms for Semipaired Domination in Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

For a graph $G=(V,E)$ with no isolated vertices, a set $D\subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$, and $(ii)$ $D$ can be part…