Linearly independent vertices and minimum semidefinite rank
From MaRDI portal
Publication:836992
DOI10.1016/j.laa.2009.03.030zbMath1188.05085OpenAlexW2058525617MaRDI QIDQ836992
Margaret Lay, Benjamin Harris, Lon H. Mitchell, Sivaram K. Narayan, Philip Hackney, Amanda Pascoe Streib
Publication date: 10 September 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.030
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items (27)
On the minimum semidefinite rank of signed graphs ⋮ Unnamed Item ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ 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 ⋮ On the graph complement conjecture for minimum rank ⋮ The minimum semidefinite rank of a triangle-free graph ⋮ The inertia set of the join of graphs ⋮ Positive semidefinite zero forcing ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Propagation tree decompositions and linearly independent vertices ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ Frame graph ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues ⋮ 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 ⋮ On the graph complement conjecture for minimum semidefinite rank ⋮ Zero forcing parameters and minimum rank problems ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ Lower bounds in minimum rank problems ⋮ Graph complement conjecture for classes of shadow graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vector representations of graphs
- On the minimum rank of the join of graphs and decomposable graphs
- The minimum rank of symmetric matrices described by a graph: a survey
- Maximum induced trees in graphs
- Graphs whose positive semi-definite matrices have nullity at most two
- A correction: Orthogonal representations and connectivity of graphs
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Orthogonal representations and connectivity of graphs
- Unitary matrix digraphs and minimum semidefinite rank
- On the minimum semidefinite rank of a simple graph
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the Shannon capacity of a graph
- Graphs whose minimal rank is two
- A survey of graph laplacians
This page was built for publication: Linearly independent vertices and minimum semidefinite rank
