Zero forcing sets and bipartite circulants
暂无分享,去创建一个
[1] Shaun M. Fallat,et al. Zero forcing parameters and minimum rank problems , 2010, 1003.2028.
[2] Shaun M. Fallat,et al. The minimum rank of symmetric matrices described by a graph: A survey☆ , 2007 .
[3] W. Haemers. Zero forcing sets and minimum rank of graphs , 2008 .
[4] S. R. Simanca,et al. On Circulant Matrices , 2012 .
[5] L. Hogben,et al. Techniques for determining the minimum rank of a small graph , 2010 .
[6] Clemens Heuberger,et al. On planarity and colorability of circulant graphs , 2003, Discret. Math..
[7] Uriel G. Rothblum,et al. An upper bound for the minimum rank of a graph , 2008 .
[8] Koji Maruyama,et al. Indirect Hamiltonian identification through a small gateway , 2009, 0903.0612.