98 citations · 106 across the 4 of their papers we have counts for
4 papers
Propagation time for probabilistic zero forcing
Jesse Geneson, Leslie Hogben
Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repea…
Note on Nordhaus-Gaddum problems for power domination
Katherine F. Benson, Daniela Ferrero, Mary Flagg +3
The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve t…
Propagation time for zero forcing on a graph
Leslie Hogben, My Huynh, Nicole Kingsley +3
Zero forcing (also called graph infection) on a simple, undirected graph is based on the color-change rule: If each vertex of is colored either white or black, and vertex $…
Zero forcing parameters and minimum rank problems
Francesco Barioli, Wayne Barrett, Shaun M. Fallat +5
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symme…