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

Matthew Booth, Philip Hackney, Benjamin Harris, Charles R. Johnson, Margaret Lay, Lon H. Mitchell, Sivaram K. Narayan, Amanda Pascoe, Kelly Steinmetz, Brian D. Sutton, Wendy Wang

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

Let P(G) be the set of all positive semidefinite matrices whose graph is G, and msr(G) be the minimum rank of all matrices in P(G). Upper and lower bounds for msr(G) are given and used to determine msr(G) for some well-known graphs, including chordal graphs, and for all simple graphs on less than seven vertices.

Original languageEnglish
Pages (from-to)731-740
Number of pages10
JournalSIAM Journal on Matrix Analysis and Applications
Volume30
Issue number2
DOIs
StatePublished - 2008

Keywords

  • Graph of a matrix
  • Positive semidefinite
  • Rank

Fingerprint

Dive into the research topics of 'On the minimum rank among positive semidefinite matrices with a given graph'. Together they form a unique fingerprint.

Cite this