Henning, M. A.; Pandey, A.; Tripathi, V.
(2021-12-06)
A dominating set D of a graph G without isolated vertices is called semipaired dominating set if D can be partitioned
into 2-element subsets such that the vertices in each set are at distance at most 2. The semipaired ...