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.15010OpenAlexW2157479900MaRDI 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
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Distance in graphs (05C12)
Related Items
Inverse eigenvalue problems for two special acyclic matrices ⋮ Inverse singular value problem for nonsymmetric ahead arrow matrix ⋮ An explicit upper bound on disparity for trees of a given diameter ⋮ The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede ⋮ Questions, conjectures, and data about multiplicity lists for trees ⋮ Multiplicities: Adding a Vertex to a Graph ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ Geometric Parter-Wiener, etc. theory ⋮ 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 ⋮ Multiplicity lists for symmetric matrices whose graphs have few missing edges ⋮ Regular graphs of degree at most four that allow two distinct eigenvalues ⋮ The implicit construction of multiplicity lists for classes of trees and verification of some conjectures ⋮ Diminimal families of arbitrary diameter ⋮ The allow sequence of distinct eigenvalues for a sign pattern ⋮ On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings ⋮ Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree ⋮ Upper bound for the diameter of a tree in the quantum graph theory ⋮ 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. ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ On the eigenvalues of generalized and double generalized stars ⋮ A note on the multiplicities of the eigenvalues of a graph ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ Change in vertex status after removal of another vertex in the general setting ⋮ Tree decomposition by eigenvectors ⋮ Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues ⋮ Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree ⋮ The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2 ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The number of distinct eigenvalues for which an index decreases multiplicity ⋮ The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree ⋮ Smith normal form and acyclic matrices ⋮ 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 ⋮ Unnamed Item ⋮ On Orthogonal Matrices with Zero Diagonal ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree ⋮ A theorem on the number of distinct eigenvalues ⋮ On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree ⋮ On the distance spectra of graphs
This page was built for publication: On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
