On the Parameterized Complexity of Semitotal Domination on Graph Classes

Lukas Retschmeier

For a given graph $G=(V,E)$, a subset of the vertices $D\subseteq V$ is called a semitotal dominating set, if $D$ is a dominating set and every vertex $v\in D$ is within distan…