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.
 J.S. Alameda, E. Curl, A. Grez, L. Hogben, A. Schulte, D. Young, and M. Young, Families of graphs with maximum nullity equal to zero forcing number. Spec. Matrices6:1 (2018), 56–67.10.1515/spma-2018-0006Search in Google Scholar
 K.F. Benson, D. Ferrero, M. Flagg, V. Furst, L. Hogben, V. Vasilevska, and B. Wissman, Zero forcing and power domination for graph products. Australas. J. Combin.70(2) (2018), 221–235.Search in Google Scholar
 G. Davis, G. Domke, 3-Circulant graphs. J. Combin. Math. Combin. Comput.40 (2002), 133–142.Search in Google Scholar
 L. DeAlba, J. Grout, L. Hogben, R. Mikkelson, and K. Rasmussen, Universally optimal matrices and field independence of the minimum rank of a graph. Electron. J. Linear Algebra 18 (2009) 403–419.Search in Google Scholar
 L. Duong, B.K. Kroschel, Zero Forcing Number (2010). Preprint.Search in Google Scholar
 S. Fallat, L. Hogben, Minimum rank, maximum nullity, and zero forcing number of graphs. In Handbook of Linear Algebra, 2nd edition, L. Hogben editor, CRC Press, Boca Raton, 2014.10.1201/b16113-53Search in Google Scholar
 L. Hogben, W. Barrett, J. Grout, H. van der Holst, K. Rasmussen, A. Smith, and D. Young. AIM minimum rank graph catalog, 2016. http://admin.aimath.org/resources/graph-invariants/minimumrankoffamilies/#/cuig.Search in Google Scholar
 A. Márquez, A. de Mier, M. Noy, and M.P. Revuelta, Locally grid graphs: classification and Tutte uniqueness. Discrete Math.266 (2003), 327–352.10.1016/S0012-365X(02)00818-XSearch in Google Scholar
 M. Riddell, The zero forcing number of circulant graphs. MSc Project, McMaster University (2017).Search in Google Scholar
 D. West, Introduction to graph theory. Prentice Hall, Inc., Upper Saddle River, NJ, 1996.Search in Google Scholar
© 2020 Linh Duong et al., published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.