Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree

DOI10.1016/J.DAM.2009.11.009MaRDI QIDQ968196zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Christopher Jordan-Squire, David A. Sher

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://scholarworks.wm.edu/aspubs/1241

zbMATH Keywords

treessymmetric matriceseigenvalue multiplicitiestwo largest multiplicities

Mathematics Subject Classification ID

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

Recommendations

• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
• Eigenvalues of matrices with tree graphs
• Multiplicities of eigenvalues and tree-width of graphs
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• scientific article; zbMATH DE number 1930773
• On the two largest eigenvalues of trees

Cites work

• Eigenvalues, multiplicities and graphs
• 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.
• Matrix Analysis
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Spectral multiplicity and splitting results for a class of qualitative matrices
• The Parter--Wiener Theorem: Refinement and Generalization
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Cited in

(15)

• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• Branch duplication for the construction of multiple eigenvalues in an 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
• The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree
• Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
• Questions, conjectures, and data about multiplicity lists for trees
• The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• Sparks of symmetric matrices and their graphs
• Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Eigenvalues, multiplicities and graphs

This page was built for publication: Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968196)