Tripathi, V.; Kloks, T.; Pandey, A.; Paul, K.; Wang, H.
(2022-06-28)
For a graph G= (V, E), a subset D of vertex set V, is a dominating set of G if every vertex not in D is adjacent to atleast one vertex of D. A dominating set D of a graph G with no isolated vertices is called a paired ...