Henning, M. A.; Pandey, A.; Tripathi, V.
(2021-07-03)
For a graph G = (V, E) with no isolated vertices, a set D ⊆ V is called a semipaired dominating
set of G if (i) D is a dominating set of G, and (ii) D can be partitioned into two element subsets such
that the vertices ...