Unordered multiplicity lists of a class of binary trees

DOI10.1016/j.laa.2011.07.006zbMath1280.05079OpenAlexW2021572790MaRDI QIDQ389635

Bryan L. Shader, In-Jae Kim

Publication date: 21 January 2014

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

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

zbMATH Keywords

eigenvaluediameterinverse eigenvalue problem\(\Phi\)-binary treepath cover numberunordered multiplicity list

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Graphs that allow all the eigenvalue multiplicities to be even

Cites Work

• Unnamed Item
• On Fiedler- and Parter-vertices of acyclic matrices
• 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.
• Matrix Analysis
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• On the eigenvalues of generalized and double generalized stars

This page was built for publication: Unordered multiplicity lists of a class of binary trees