论文信息 - Lower Bounds in Minimum Rank Problems

Lower Bounds in Minimum Rank Problems

Abstract The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the given graph. The minimum semidefinite rank of a graph is the minimum rank among Hermitian positive semidefinite matrices with the given graph. We explore connections between OS-sets and a lower bound for minimum rank related to zero forcing sets as well as exhibit graphs for which the difference between the minimum semidefinite rank and these lower bounds can be arbitrarily large.

Lon H. Mitchell | Sivaram K. Narayan | Andrew Zimmer | S. Narayan | Andrew M. Zimmer

[1] R. Loewy,et al. GRAPHS WHOSE MINIMAL RANK IS TWO , 2004 .

[2] Tomaz Pisanski,et al. Vector representations of graphs , 1989, Discret. Math..

[3] Shaun M. Fallat,et al. The minimum rank of symmetric matrices described by a graph: A survey☆ , 2007 .

[4] Lon H. Mitchell,et al. Linearly independent vertices and minimum semidefinite rank , 2009 .

[5] L. Lovász,et al. Orthogonal representations and connectivity of graphs , 1989 .

[6] Uriel G. Rothblum,et al. An upper bound for the minimum rank of a graph , 2008 .

[7] Alexander Schrijver,et al. A correction: orthogonal representations and connectivity of graphs , 2000 .

[8] W. Haemers. Zero forcing sets and minimum rank of graphs , 2008 .

[9] Hein van der Holst,et al. Three-connected graphs whose maximum nullity is at most three , 2008 .

[10] Wendy Wang,et al. On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph , 2008, SIAM J. Matrix Anal. Appl..

[11] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.