✦ LIBER ✦

On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph

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

Book ID: 118215886
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 152 KB
Volume: 30
Category: Article
ISSN: 0895-4798
DOI: 10.1137/050629793

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the positive semid

A new lower bound for the positive semidefinite minimum rank of a graph

✍ Andrew M. Zimmer 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 392 KB

A Remark on the Rank of Positive Semidef

A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints

✍ A. Barvinok 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 68 KB

The maximum order of adjacency matrices

The maximum order of adjacency matrices of graphs with a given rank

✍ W. H. Haemers, M. J. P. Peeters 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 151 KB

A note on universally optimal matrices a

A note on universally optimal matrices and field independence of the minimum rank of a graph

✍ Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr F (G), is defined to be the smallest possible rank among all n × n symmetric matrices over F whose (i, j)th entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A symmetric integ