Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

DOI10.1515/spma-2019-0025zbMath1433.15014OpenAlexW2995252354MaRDI QIDQ2302884

Carlos M. Saiago

Publication date: 26 February 2020

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

Full work available at URL: https://doi.org/10.1515/spma-2019-0025

zbMATH Keywords

treeeigenvaluediameterdiagonalizable matrixgraph of a matrixgeometric multiplicityassignmentsbranch duplicationcombinatorially symmetric

Mathematics Subject Classification ID

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

Related Items (3)

Further generalization of symmetric multiplicity theory to the geometric case over a field ⋮ Change in vertex status after removal of another vertex in the general setting ⋮ A theorem on the number of distinct eigenvalues

Cites Work

• Unnamed Item
• Questions, conjectures, and data about multiplicity lists for trees
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• 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
• Geometric Parter-Wiener, etc. theory
• Multiplicity lists for symmetric matrices whose graphs have few missing edges
• The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• Diameter minimal trees
• Branch duplication in trees: uniqueness of seeds and enumeration of seeds
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• Implicit construction of multiple eigenvalues for trees
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Eigenvalues, Multiplicities and Graphs
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments