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

DOI10.1137/050629793MaRDI QIDQ3624865zbMATH OpenOpenAlexFDO

Authors Matt Booth, Philip Hackney, Benjamin Harris, Charles R. Johnson, Margaret Lay, S. K. Narayan, Kelly Steinmetz, Brian D. Sutton, Wendy Wang, 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

zbMATH Keywords

rankgraph of a matrixpositive semidefinite

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• On the minimum rank among positive semidefinite matrices and tree size of a given graph of at most seven vertices
• On the minimum semidefinite rank of a simple graph
• A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph
• Bounds on minimum semidefinite rank of graphs
• Computing positive semidefinite minimum rank for small graphs

Cited in

(53)

• Vector representations of graphs and distinguishing quantum product states with one-way LOCC
• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• Computing positive semidefinite minimum rank for small graphs
• Positive semidefinite zero forcing numbers of two classes of graphs
• Linearly independent vertices and minimum semidefinite rank
• Unitary matrix digraphs and minimum semidefinite rank
• Frame graph
• Lower bounds in minimum rank problems
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• Bounds on minimum semidefinite rank of graphs
• A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph
• A note on universally optimal matrices and field independence of the minimum rank of a graph
• On the graph complement conjecture for minimum semidefinite rank
• Graph complement conjecture for classes of shadow graphs
• The minimum semidefinite rank of a triangle-free graph
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
• Orthogonal representations, minimum rank, and graph complements
• A reduction procedure for the Colin de Verdière number of a graph
• On the minimum rank among positive semidefinite matrices and tree size of a given graph of at most seven vertices
• The minimum rank problem for circulants
• Line graphs: their maximum nullities and zero forcing numbers.
• On the minimum number of distinct eigenvalues of a threshold graph
• On the minimum vector rank of multigraphs
• Minimum semidefinite rank of signed graphs and partial 3-trees
• A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
• Minimum-rank matrices with prescribed graph
• Tree cover number and maximum semidefinite nullity of some graph classes
• A new lower bound for the positive semidefinite minimum rank of a graph
• Bounds on the sum of minimum semidefinite rank of a graph and its complement
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs
• On the minimum semidefinite rank of signed graphs
• On the minimum semidefinite rank of a simple graph
• On the complexity of the positive semidefinite zero forcing number
• The minimum rank of symmetric matrices described by a graph: a survey
• The complexity of the positive semidefinite zero forcing
• Determining the minimum rank of matroids whose basis graph is common
• On the tree cover number and the positive semidefinite maximum nullity of a graph
• Graphs whose positive semi-definite matrices have nullity at most two
• A New Lower Bound for Positive Zero Forcing
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Orthogonal representations of Steiner triple system incidence graphs
• Positive semidefinite zero forcing: complexity and lower bounds
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• Lower bounds for positive semidefinite zero forcing and their applications
• Chordal graphs and distinguishability of quantum product states
• Positive semidefinite zero forcing
• Matrices attaining the minimum semidefinite rank of a chordal graph
• A note on the positive semidefinite minimum rank of a sign pattern matrix
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic

This page was built for publication: On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624865)