A note on universally optimal matrices and field independence of the minimum rank of a graph
From MaRDI portal
Publication:977476
DOI10.1016/j.laa.2010.03.027zbMath1216.05075OpenAlexW2077595433MaRDI QIDQ977476
Hong-Gwa Yeh, Liang-Hao Huang, Gerard Jennhwa Chang
Publication date: 22 June 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.03.027
graphranksymmetric matrixmatrixminimum rankmaximum nullityuniversally optimal matrixfield independent
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum rank of symmetric matrices described by a graph: a survey
- Computation of minimal rank and path cover number for certain graphs
- Zero forcing sets and the minimum rank of graphs
- Minimum-rank matrices with prescribed graph
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- A new 5‐arc‐transitive cubic graph