On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree

DOI10.7153/mia-05-19zbMath1002.15010MaRDI QIDQ4542894

António Leal-Duarte, Charles R. Johnson

Publication date: 15 January 2003

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7153/mia-05-19

zbMATH Keywords

tree; graph; Hermitian matrix; symmetric matrix; minimum number of distinct eigenvalues

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

15B57: Hermitian, skew-Hermitian, and related matrices

05C12: Distance in graphs

Related Items

Unnamed Item, Multiplicities: Adding a Vertex to a Graph, On Orthogonal Matrices with Zero Diagonal, On the eigenvalues of generalized and double generalized stars, A note on the multiplicities of the eigenvalues of a graph, On the distance spectra of graphs, Inverse eigenvalue problems for two special acyclic matrices, Questions, conjectures, and data about multiplicity lists for trees, Unordered multiplicity lists of a class of binary trees, Acyclic matrices with a small number of distinct eigenvalues, Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree, The number of distinct eigenvalues for which an index decreases multiplicity, The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree, Tree decomposition by eigenvectors, Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree, The minimum rank of symmetric matrices described by a graph: a survey, Smith normal form and acyclic matrices, 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, Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede, Geometric Parter-Wiener, etc. theory, Multiplicity lists for symmetric matrices whose graphs have few missing edges, A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph, The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree, The implicit construction of multiplicity lists for classes of trees and verification of some conjectures, The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2, On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings, Change in vertex status after removal of another vertex in the general setting, Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues, 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, Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree