Dom-forcing sets in graphs

Susanth P, Charles Dominic, Premodkumar K P

A dominating set $D_f\subseteq V(G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $⟨D_f⟩$ must form a zero forcing se…