Pandey, A.; Panda, B. S.
(2021-08-27)
A set D ⊆ V is called a dominating set of G = (V, E) if |NG[v] ∩ D| ≥ 1 for all v ∈ V. The
Minimum Domination problem is to find a dominating set of minimum cardinality of the
input graph. In this paper, we study the ...