Linearly independent vertices and minimum semidefinite rank
DOI10.1016/J.LAA.2009.03.030zbMATH Open1188.05085OpenAlexW2058525617MaRDI QIDQ836992FDOQ836992
Authors: Philip Hackney, Benjamin Harris, Margaret Lay, Lon H. Mitchell, S. K. Narayan, 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Shannon capacity of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum induced trees in graphs
- Graphs whose positive semi-definite matrices have nullity at most two
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The minimum rank of symmetric matrices described by a graph: a survey
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Graphs whose minimal rank is two
- A survey of graph laplacians
- Orthogonal representations and connectivity of graphs
- On the minimum semidefinite rank of a simple graph
- Vector representations of graphs
- Title not available (Why is that?)
- A correction: Orthogonal representations and connectivity of graphs
- On the minimum rank of the join of graphs and decomposable graphs
- Unitary matrix digraphs and minimum semidefinite rank
Cited In (28)
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Positive semidefinite zero forcing numbers of two classes of graphs
- Unitary matrix digraphs and minimum semidefinite rank
- Propagation tree decompositions and linearly independent vertices
- Frame graph
- Lower bounds in minimum rank problems
- Title not available (Why is that?)
- Bounds on minimum semidefinite rank of graphs
- On the graph complement conjecture for minimum rank
- Graph complement conjecture for classes of shadow graphs
- On the graph complement conjecture for minimum semidefinite rank
- The minimum semidefinite rank of a triangle-free graph
- Orthogonal representations, minimum rank, and graph complements
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- A new lower bound for the positive semidefinite minimum rank of a graph
- Zero forcing parameters and minimum rank problems
- On the minimum semidefinite rank of signed graphs
- On the complexity of the positive semidefinite zero forcing number
- The minimum rank of symmetric matrices described by a graph: a survey
- The inertia set of the join of graphs
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- On the relationships between zero forcing numbers and certain graph coverings
- Zero forcing number, Grundy domination number, and their variants
- Chordal graphs and distinguishability of quantum product states
- Positive semidefinite zero forcing
- Bounds for minimum semidefinite rank from superpositions and cutsets
This page was built for publication: Linearly independent vertices and minimum semidefinite rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836992)
