Zero Forcing Sets and Bipartite Circulants
Combinatorics
2010-11-29 v1
Abstract
In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only on the parameters that describe its biadjacency matrix. The main results of the paper characterize the bipartite circulant graphs that achieve equality in the lower bound.
Cite
@article{arxiv.1011.5851,
title = {Zero Forcing Sets and Bipartite Circulants},
author = {Seth A. Meyer},
journal= {arXiv preprint arXiv:1011.5851},
year = {2010}
}
Comments
22 pages, 13 figures