%0 Journal Article %1 meyer12 %A Meyer, Seth A. %D 2012 %J Linear Algebra and its Applications %K bipartite circulant graph.theory %N 4 %P 888--900 %R 10.1016/j.laa.2011.09.022 %T Zero forcing sets and bipartite circulants %V 436 %X In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices – a generalization of circulant graphs which happen to be bipartite – 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 and compute their minimum ranks.

@article{meyer12, abstract = {In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices – a generalization of circulant graphs which happen to be bipartite – 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 and compute their minimum ranks. }, added-at = {2016-12-04T10:10:09.000+0100}, author = {Meyer, Seth A.}, biburl = {https://www.bibsonomy.org/bibtex/2a524526c9d3176568de95ddf307540ea/ytyoun}, doi = {10.1016/j.laa.2011.09.022}, interhash = {17e0ba2bcd1161e345271d6afa13edcb}, intrahash = {a524526c9d3176568de95ddf307540ea}, issn = {0024-3795}, journal = {Linear Algebra and its Applications}, keywords = {bipartite circulant graph.theory}, number = 4, pages = {888--900}, timestamp = {2016-12-04T10:10:09.000+0100}, title = {Zero forcing sets and bipartite circulants}, volume = 436, year = 2012 }