The number of distinct eigenvalues for which an index decreases multiplicity

DOI10.1016/j.laa.2016.11.033zbMath1352.15013OpenAlexW2553108772MaRDI QIDQ730608

António Leal-Duarte, Carlos M. Saiago, Charles R. Johnson

Publication date: 28 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.033

zbMATH Keywords

treediametereigenvalue multiplicitydiameter minimal treesdowner branch mechanismdowner vertex

Mathematics Subject Classification ID

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

Cites Work

• The structure of matrices with a maximum multiplicity eigenvalue
• 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.
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Diameter minimal trees
• Matrix Analysis
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree

This page was built for publication: The number of distinct eigenvalues for which an index decreases multiplicity