On the minimum rank of the third power of a starlike tree
From MaRDI portal
Publication:417547
DOI10.1016/J.LAA.2011.08.045zbMATH Open1241.05088OpenAlexW2130308244MaRDI QIDQ417547FDOQ417547
Authors: Li Sheng, Xiaoling Shen, Yaoping Hou
Publication date: 14 May 2012
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.08.045
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Computation of minimal rank and path cover number for certain graphs
- Minimum rank problems
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- On minimum rank and zero forcing sets of a graph
- Techniques for determining the minimum rank of a small graph
- An upper bound for the minimum rank of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Universally optimal matrices and field independence of the minimum rank of a graph
Cited In (3)
This page was built for publication: On the minimum rank of the third power of a starlike tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417547)