On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
From MaRDI portal
Publication:4542894
DOI10.7153/mia-05-19zbMath1002.15010MaRDI QIDQ4542894
Charles R. Johnson, António Leal-Duarte
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
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
On the eigenvalues of generalized and double generalized stars, A note on the multiplicities of the eigenvalues of a graph, 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 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, The implicit construction of multiplicity lists for classes of trees and verification of some conjectures, Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues, Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
