Spectral arbitrariness for trees fails spectacularly
- 14 July 2024
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 169, 161-210
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (RGPIN\u20132019\u201303934)
- the Slovenian Research and Innovation Agency (P1-0222, J1-3004)
This publication has 29 references indexed in Scilit:
- The inverse eigenvalue problem for linear treesDiscrete Mathematics, 2022
- The inverse eigenvalue problem of a graph: Multiplicities and minorsJournal of Combinatorial Theory, Series B, 2020
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a GraphJournal of Graph Theory, 2012
- Smith Normal Form and acyclic matricesJournal of Algebraic Combinatorics, 2008
- Computation of minimal rank and path cover number for certain graphsLinear Algebra and its Applications, 2004
- Minimum-rank matrices with prescribed graphLinear Algebra and its Applications, 1996
- Construction of a Jacobi matrix from spectral dataLinear Algebra and its Applications, 1976
- Inverse eigenvalue problems for Jacobi matricesLinear Algebra and its Applications, 1976
- Combinatorially symmetric matricesLinear Algebra and its Applications, 1974
- On the construction of a Jacobi matrix from spectral dataLinear Algebra and its Applications, 1974