Zero forcing sets and bipartite circulants
Zero forcing sets and bipartite circulants
复制标题
DOI：
10.1016/j.laa.2011.09.022
复制
发表时间：
2010-11
影响因子：
1.1
通讯作者：
Seth A. Meyer
中科院分区：
文献类型：
--
作者：
Seth A. Meyer
在本文中，我们介绍了一类正则二分图，其邻接矩阵是循环矩阵——恰好是二分循环图的推广——并且我们描述了它们的一些属性。值得注意的是，我们仅根据描述其邻接矩阵的参数来计算此类图的迫零数的上限和下限。论文的主要结果描述了在下界实现相等并计算其最小等级的二分循环图。
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.