1 paper
Susanth P, Charles Dominic, Premodkumar K P
In a graph G, a dominating set Df subset of V (G) is called a dom-forcing set if the sub-graph induced by Df must form a zero forcing set. The minimum cardinality of such a set is…