Henning, M.A.; Pandey, A.
(2019-01-02)
For a graph G = (V, E), a set D ⊆ 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 another vertex
of D. The Minimum Semitotal Domination problem is ...