2 citations · 3 across the 7 of their papers we have counts for
1 paper · 1 filter
Aidan Johnson, Andrew E. Vick, Darren A. Narayan
Given a graph G, the zero forcing number of G, Z(G), is the smallest cardinality of any set S of vertices on which repeated applications of the forcing rule results in all…