On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
From MaRDI portal
Publication:3624865
DOI10.1137/050629793zbMath1226.05151OpenAlexW2036681141MaRDI QIDQ3624865
Benjamin Harris, Margaret Lay, Philip Hackney, Wendy Wang, Charles R. Johnson, Kelly Steinmetz, Matt Booth, Brian D. Sutton, Sivaram K. Narayan, Lon H. Mitchell, Amanda Pascoe Streib
Publication date: 30 April 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/16c580a1c4cac9db09a9a90a198557367c53af5d
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
On the minimum number of distinct eigenvalues of a threshold graph ⋮ Linearly independent vertices and minimum semidefinite rank ⋮ Positive Semidefinite Zero Forcing: Complexity and Lower Bounds ⋮ Unnamed Item ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ The Complexity of the Positive Semidefinite Zero Forcing ⋮ Matrices attaining the minimum semidefinite rank of a chordal graph ⋮ Vector representations of graphs and distinguishing quantum product states with one-way LOCC ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Positive semidefinite zero forcing ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ A New Lower Bound for Positive Zero Forcing ⋮ On the minimum semidefinite rank of a simple graph ⋮ Frame graph ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues ⋮ Zero forcing sets and the minimum rank of graphs ⋮ Unitary matrix digraphs and minimum semidefinite rank ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Zero forcing parameters and minimum rank problems ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ The minimum rank problem for circulants ⋮ A reduction procedure for the Colin de Verdière number of a graph ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ Unnamed Item ⋮ Lower bounds in minimum rank problems ⋮ Graph complement conjecture for classes of shadow graphs
