2 papers
math.CO2025
Connected dom-forcing sets in graphs
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…
math.CO2024
Dom-forcing sets in graphs
Susanth P, Charles Dominic, Premodkumar K P
A dominating set of vertices in a graph is called a \emph{dom-forcing set} if the sub-graph induced by must form a zero forcing se…