Maximum nullity and zero forcing of circulant graphs
Combinatorics
2019-06-10 v1
Abstract
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 certain circulant graphs, including some bipartite circulants, cubic circulants, and circulants which are torus products, to obtain bounds on the minimum rank and the maximum nullity. We also evaluate when the zero forcing number will give equality.
Cite
@article{arxiv.1906.03079,
title = {Maximum nullity and zero forcing of circulant graphs},
author = {Linh Duong and Brenda K. Kroschel and Michael Riddell and Kevin N. Vander Meulen and Adam Van Tuyl},
journal= {arXiv preprint arXiv:1906.03079},
year = {2019}
}
Comments
14 pages; comments welcomed