Algorithmic Aspects of Semitotal Domination in Graphs

Michael A. Henning, Arti Pandey

For a graph $G=(V,E)$, a set $D\subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$, and every vertex in $D$ is within distance~$2$ of anothe…