1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
Zero Forcing of Generalized Hierarchical Products of Graphs
Heather LeClair, Tim Spilde, Sarah Anderson +1
Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing…
Maximum nullity and zero forcing of circulant graphs
Linh Duong, Brenda K. Kroschel, Michael Riddell +2
It is well-known that the zero forcing number of a graph provides a lower bound on the minimum rank of a graph. In this paper we bound and characterize the zero forcing number of c…
Properties of a -analogue of zero forcing
Steve Butler, Craig Erickson, Shaun Fallat +6
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation…