Henning, M.A; Pandey, A.; Tripathi, V.
(2024-07-07)
In a graph G = (V , E) without an isolated vertex, a dominating set D ⊆ V is a paired
dominating set if the graph G[D] induced by D has a perfect matching. Further, a set
D ⊆ V is a disjunctive dominating set of G if for ...