Abstract
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 number is the smallest number of vertices that
must be filled to begin the process so that the entire graph or network becomes
filled. In this paper, bounds are provided on the zero forcing number of
generalized hierarchical products.