Answers are grounded in this paper and cite their sources.
A set S of black colored vertices in a graph G is called a zero forcing set of G if at every discrete time step, a black vertex with exactly one non-black vertex as its neighbour forces it to be colored black and by iteratively applying the procedure, all vertices in G are colored black. If S induces an independent set of edges, then S is termed an edge-forcing set of G . The minimum cardinality of edge-forcing sets of G , denoted by ζe ( G ) is called edge-forcing number of G . In this paper, we obtain the edge-forcing number for Sierpiński graphs and Sierpiński gasket graphs.
No takes yet. Share an insight, caveat, or question.
Anitha et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: