On the minimum rank among positive semidefinite matrices with a given graph

SIAM Journal on Matrix Analysis and Applications

Volumn 30, Issue 2, 2008, Pages 731-740

  Booth, Matthew ^a   Hackney, Philip ^b   Harris, Benjamin ^c   Johnson, Charles R ^d   Lay, Margaret ^e   Mitchell, Lon H ^f   Narayan, Sivaram K ^g   Pascoe, Amanda ^h   Steinmetz, Kelly ⁱ   Sutton, Brian D ^j   Wang, Wendy ^k  

^a OBERLIN COLLEGE   (United States)

^b PURDUE UNIVERSITY   (United States)

^c BROWN UNIVERSITY   (United States)

^d Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

^e GRINNELL COLLEGE   (United States)

^f VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

^g CENTRAL MICHIGAN UNIVERSITY   (United States)

^h FURMAN UNIVERSITY   (United States)

ⁱ INDIANA UNIVERSITY   (United States)

^j RANDOLPH MACON COLLEGE   (United States)

^k DUKE UNIVERSITY   (United States)

more..

Author keywords

Graph of a matrix; Positive semidefinite; Rank

Indexed keywords

CHORDAL GRAPHS; GRAPH OF A MATRIX; MINIMUM RANK; POSITIVE SEMIDEFINITE; POSITIVE SEMIDEFINITE MATRICES; RANK; UPPER AND LOWER BOUNDS;

CONTROL THEORY;

GRAPH THEORY;

EID: 67649222914     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050629793     Document Type: Article

References (17)

1. W. BARRETT, H. VAN DER HOLST, and R. LOEWY, Graphs whose minimal rank is two, Electron. J. Linear Algebra, 11 (2004), pp. 258-280.
2. B. BOLLOBÁS, Modern Graph Theory, Grad. Texts in Math. 184, Springer, New York, 1984.
3. Y. COLIN DE VERDIÈRE, Multiplicities of eigenvalues and tree-width of graphs, J. Combin. Theory Ser. B, 74 (1998), pp. 121-146.
4. P. ERDOS, M. SAKS, AND V. SÓS, Maximum induced trees in graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 61-79.
5. R. HORN and C.R. JOHNSON, Matrix Analysis, Cambridge University Press, New York, 1985.
6. C. R. JOHNSON and A. LEAL-DUARTE, The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, Linear Multilinear Algebra, 46 (1999), pp. 139-144.
7. C. R. JOHNSON and A. LEAL-DUARTE, On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree, Linear Algebra Appl., 348 (2002), pp. 7-21.
8. C. R. JOHNSON and A. LEAL-DUARTE, Converse to the Parter-Wiener theorem: The case of non-trees, Discrete Math., 306 (2006), pp. 3125-3129.
9. C. R. JOHNSON AND C. M. SAIAGO, Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix, Electron. J. Linear Algebra, 9 (2002), pp. 27-31.
10. C. R. JOHNSON, A. LEAL-DUARTE, C. M. SAIAGO, B. D. SUTTON. and A. J. WITT, On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph, Linear Algebra Appl., 363 (2003), pp. 147-159.
11. C. R. JOHNSON, A. LEAL-DUARTE, and C. M. SAIAGO, Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars, Linear Algebra Appl., 373 (2003), pp. 311-330.
12. C. R. JOHNSON, B. KROSCHEL, and M. OMLADIC, Eigenvalue multiplicities in principal submatrices, Linear Algebra Appl., 390 (2004), pp. 111-120.
13. A. LEAL-DUARTE AND C. R. JOHNSON, On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree, Math. Inequal. Appl., 5 (2002), pp. 175-180.
14. R. MERRIS, A survey of graph Laplacians, Linear Multilinear Algebra, 39 (1995), pp. 19-31.
15. N. J. PULLMAN, Clique Coverings of Graphs-A survey, in Combinatorial Mathematics X, L. R. A. Casse, ed., Springer, Berlin, 1983, pp. 72-85.
16. R. C. READ and R. J. WILSON, An Atlas of Graphs, Oxford University Press, New York, 1998.
17. H. VAN DER HOLST, Graphs whose positive semi-definite matrices have nullity at most two. Linear Algebra Appl., 375 (2003), pp. 1-11.