The implicit construction of multiplicity lists for classes of trees and verification of some conjectures

DOI10.1016/J.LAA.2012.11.010zbMath1258.05070OpenAlexW2054450157WikidataQ122971267 ScholiaQ122971267MaRDI QIDQ1938661

Jonathan Nuckols, Charles R. Johnson, Calum Spicer

Publication date: 22 February 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.11.010

zbMATH Keywords

eigenvaluestreesmultiplicitiesdegree conjectureimplicit function theorem construction

Mathematics Subject Classification ID

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

Related Items (7)

Questions, conjectures, and data about multiplicity lists for trees ⋮ The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree ⋮ Inverse spectral problems for collections of leading principal submatrices of tridiagonal matrices ⋮ Graphs that allow all the eigenvalue multiplicities to be even ⋮ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments ⋮ The inverse eigenvalue problem for linear trees

Cites Work

• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Implicit construction of multiple eigenvalues for trees
• Matrix Analysis
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The implicit construction of multiplicity lists for classes of trees and verification of some conjectures