A new lower bound for the positive semidefinite minimum rank of a graph
DOI10.1016/j.laa.2012.09.001zbMath1257.05092OpenAlexW2089261825MaRDI QIDQ1931723
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.09.001
minimum rankzero forcing numberpositive semidefinite minimum ranksign patternspositive semidefinite zero forcing numberordered set number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03) Sign pattern matrices (15B35)
Related Items (2)
Cites Work
- Unnamed Item
- On the graph complement conjecture for minimum rank
- Vector representations of graphs
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Linearly independent vertices and minimum semidefinite rank
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
- Zero forcing parameters and minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- Lower bounds in minimum rank problems
- A note on vector representation of graphs
- Zero forcing sets and the minimum rank of graphs
- On the minimum semidefinite rank of a simple graph
- A note on minimum rank and maximum nullity of sign patterns
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
- On the maximum positive semi-definite nullity and the cycle matroid of graphs
- Complexity Lower Bounds using Linear Algebra
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
This page was built for publication: A new lower bound for the positive semidefinite minimum rank of a graph
