Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree

DOI10.1080/03081080600597668zbMath1149.15007OpenAlexW2055791568MaRDI QIDQ3518580

Charles R. Johnson, Carlos M. Saiago

Publication date: 8 August 2008

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

Full work available at URL: https://doi.org/10.1080/03081080600597668

zbMATH Keywords

Hermitian matriceseigenvaluestreesinverse eigenvalue problemmultiplicitiesbranch duplication

Mathematics Subject Classification ID

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

Related Items (9)

An explicit upper bound on disparity for trees of a given diameter ⋮ The change in eigenvalue multiplicity associated with perturbation of a diagonal entry ⋮ Questions, conjectures, and data about multiplicity lists for trees ⋮ Multiplicity lists for symmetric matrices whose graphs have few missing edges ⋮ The structure of matrices with a maximum multiplicity eigenvalue ⋮ Diameter minimal trees ⋮ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments ⋮ Branch duplication in trees: uniqueness of seeds and enumeration of seeds ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree

Cites Work

• Spectral multiplicity and splitting results for a class of qualitative matrices
• Construction of acyclic matrices from spectral data
• 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 relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Imbedding Conditions for Hermitian and Normal Matrices
• Matrices, Digraphs, and Determinants
• Matrix Analysis
• A survey of matrix inverse eigenvalue problems
• 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
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree