Decompositions of minimum rank matrices
From MaRDI portal
Publication:389662
DOI10.1016/j.laa.2011.12.036zbMath1280.05076OpenAlexW1983546911MaRDI QIDQ389662
William Sexton, Nicole Malloy, Mark Kempton, Curtis Nelson, John Sinkovic, Wayne W. Barrett
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.12.036
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- The minimum rank problem over the finite field of order 2: Minimum rank 3
- Computation of minimal rank and path cover number for certain graphs
- The maximum corank of graphs with a 2-separation
- Minimum-rank matrices with prescribed graph
- The inverse eigenvalue and inertia problems for minimum rank two graphs
- On the maximum positive semi-definite nullity and the cycle matroid of graphs
This page was built for publication: Decompositions of minimum rank matrices