Implicit construction of multiple eigenvalues for trees
From MaRDI portal
Publication:3633151
DOI10.1080/03081080701852756zbMATH Open1176.15011OpenAlexW2043670863MaRDI QIDQ3633151FDOQ3633151
Brian D. Sutton, Charles R. Johnson, Andrew J. Witt
Publication date: 17 June 2009
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080701852756
Recommendations
- The multiplicity of eigenvalues of trees
- On the multiplicity of eigenvalues of trees
- A note on the multiplicities of the eigenvalues of a tree
- On the multiple eigenvalue of Randić matrix of trees
- The trees for which maximum multiplicity implies the simplicity of other eigenvalues
- Trees with a large Laplacian eigenvalue multiplicity
- Eigenvalues of matrices with tree graphs
- Locating the eigenvalues of trees
- Constructing trees with given eigenvalues and angles
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- The Parter--Wiener Theorem: Refinement and Generalization
- 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.
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
Cited In (8)
- Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- The inverse eigenvalue problem for linear trees
- The change in eigenvalue multiplicity associated with perturbation of a diagonal entry
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
- Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
- Numerical construction of structured matrices with given eigenvalues
- The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
This page was built for publication: Implicit construction of multiple eigenvalues for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633151)