The inverse eigenvalue problem for linear trees

DOI10.1016/J.DISC.2021.112737zbMATH Open1483.15008OpenAlexW4205494124MaRDI QIDQ2075498FDOQ2075498

Authors Yanyan Li

Publication date 14 February 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.06257

zbMATH Keywords

diameterinverse eigenvalue problemimplicit function theoremlinear treedegree conjecturemultiplicity list

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)

Abstract: We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014. This is the most general class of trees for which the inverse eigenvalue problem has been solved. We explore many consequences, including the Degree Conjecture for possible spectra, upper bounds for the minimum number of eigenvalues of multiplicity $1$, and the equality of the diameter of a linear tree and its minimum number of distinct eigenvalues, etc.

Recommendations

• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• On the inverse eigenvalue problems: the case of superstars

Cites work

• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Advanced determinant calculus
• Eigenvalues, multiplicities and graphs
• Implicit construction of multiple eigenvalues for trees
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• On the construction of a Jacobi matrix from spectral data
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• Questions, conjectures, and data about multiplicity lists for trees
• The Parter--Wiener Theorem: Refinement and Generalization
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• The proportion of trees that are linear

Cited in

(10)

• On the inverse eigenvalue problems: the case of superstars
• Distinct eigenvalues are realizable with generic eigenvectors
• Spectral arbitrariness for trees fails spectacularly
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• The inverse problem for certain tree parameters
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
• The liberation set in the inverse eigenvalue problem of a graph
• Null vectors, Schur complements, and Parter vertices

This page was built for publication: The inverse eigenvalue problem for linear trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075498)