Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

Esther Galby, Andrea Munaro, Bernard Ries

A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The…