Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree

DOI10.1016/J.DISC.2014.04.030MaRDI QIDQ400401zbMATH OpenOpenAlexFDO

Authors Andrew A. Li, Andrew J. Walker, Charles R. Johnson

Publication date 21 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.04.030

zbMATH Keywords

eigenvaluemultiplicitysymmetric matrixlinear tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Recommendations

• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Eigenvalues, multiplicities and graphs
• Questions, conjectures, and data about multiplicity lists for trees
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• Multiplicity lists for symmetric matrices whose graphs have few missing edges

Cites work

• Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
• 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.
• Matrix Analysis
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Spectral multiplicity and splitting results for a class of qualitative matrices
• Structured inverse eigenvalue problems
• The Parter--Wiener Theorem: Refinement and Generalization
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Cited in

(13)

• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• Diameter minimal trees
• Multiplicities: adding a vertex to a graph
• The change in multiplicity of an eigenvalue due to adding or removing edges
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a 2-linear tree
• The inverse eigenvalue problem for linear trees
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
• Questions, conjectures, and data about multiplicity lists for trees
• Unordered multiplicity lists of a class of binary trees
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
• The proportion of trees that are linear
• Multiplicity lists for symmetric matrices whose graphs have few missing edges
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures

This page was built for publication: Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree

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