With L. Duong, B. Kroschel, M. Riddell and A. Van Tuyl. In Special Matrices 8 (2020): pp. 221-234

The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems. 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 various circulant graphs, including families of bipartite circulants, as well as all cubic circulants. We extend the definition of the Möbius ladder to a type of torus product to obtain bounds on the minimum rank and the maximum nullity on these products. We obtain equality for torus products by employing orthogonal Hankel matrices. In fact, in every circulant graph for which we have determined these numbers, the maximum nullity equals the zero forcing number. It is an open question whether this holds for all circulant graphs.

Publication Information


Dr. Kevin Vander Meulen

Publisher or Title:

Special Matrices

Publication date: