The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree

DOI10.1515/spma-2015-0001zbMath1310.15016OpenAlexW1579929328MaRDI QIDQ2259450

Rosário Fernandes

Publication date: 4 March 2015

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/spma-2015-0001

zbMATH Keywords

treesHermitian matrixsymmetric matricescombinatorial algorithmeigenvalue multiplicitiestwo largest multiplicities

Mathematics Subject Classification ID

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

Related Items (1)

Sparks of symmetric matrices and their graphs

Cites Work

• Spectral multiplicity and splitting results for a class of qualitative matrices
• Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
• 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 possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• On the inverse eigenvalue problems: the case of superstars
• 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 Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree