Implicit construction of multiple eigenvalues for trees

DOI10.1080/03081080701852756MaRDI QIDQ3633151zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Brian D. Sutton, 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

zbMATH Keywords

graphtreeeigenvaluesvinemultiplicityreal symmetric matrix

Mathematics Subject Classification ID

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

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

Cites work

• 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 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
• The Parter--Wiener Theorem: Refinement and Generalization
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Cited in

(11)

• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• Constructions of graphs and trees with partially prescribed spectrum
• Construction of matrices with a given graph and prescribed interlaced spectral data
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• The nowhere-zero eigenbasis problem for a graph
• 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)