Back to Search
Start Over
Zero forcing sets and bipartite circulants
- Source :
-
Linear Algebra & its Applications . Feb2012, Vol. 436 Issue 4, p888-900. 13p. - Publication Year :
- 2012
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 436
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 70392539
- Full Text :
- https://doi.org/10.1016/j.laa.2011.09.022