Sara Anderton, Rilee Burden, McKenzie Fontenot, Noah
Fredrickson, Alexandria Kwon, Sydney Le, Kanno Mizozoe, Erin
Raign, August Sangalli, Houston Schuerger and Andrew
Schwartz
Zero forcing is a dynamic coloring process on graphs. Initially, each vertex of a graph
is assigned a color of either blue or white, and then a process begins by which blue
vertices force white vertices to become blue. The zero forcing number is the
cardinality of the smallest set of initially blue vertices which can force the entire
graph to become blue, and the propagation time is the minimum number of steps in
such a zero forcing process. In this paper, we determine the zero forcing numbers and
propagation times of two infinite classes of graphs called gear graphs and helm
graphs.
Keywords
graph classes, zero forcing, propagation time, relaxed
chronology, chain set