Kloks, T.; Pandey, A.
(2021-12-03)
For a graph G = (V,E) with no isolated vertices, a set D ⊆ V
is called a semitotal dominating set of G if (i) D is a dominating set of
G, and (ii) every vertex in D has another vertex in D at a distance
at most two. The ...