On the minimum rank of not necessarily symmetric matrices: A preliminary study
DOI10.13001/1081-3810.1300zbMath1169.05345MaRDI QIDQ3394472
Hein van der Holst, Francesco Barioli, H. Tracy Hall, Daniel Hershkowitz, Shaun M. Fallat, Leslie Hogben, Bryan L. Shader
Publication date: 7 September 2009
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130472
graph; rank; inverse eigenvalue problem; symmetric matrix; minimum degree; edit distance; minimum rank; maximum nullity; zero forcing number; zero forcing set; directed tree; path cover number; triangle number; asymmetric minimum rank; ditree; symmetric minimum rank
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Uses Software