Unordered multiplicity lists of a class of binary trees
DOI10.1016/J.LAA.2011.07.006zbMATH Open1280.05079OpenAlexW2021572790MaRDI QIDQ389635FDOQ389635
Authors: In-Jae Kim, Bryan L. Shader
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
Recommendations
- Eigenvalues, multiplicities and graphs
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
- Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
diametereigenvalueinverse eigenvalue problem\(\Phi\)-binary treepath cover numberunordered multiplicity list
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35)
Cites Work
- Matrix Analysis
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- The Parter--Wiener Theorem: Refinement and Generalization
- 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.
- Eigenvalues, multiplicities and graphs
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- On Fiedler- and Parter-vertices of acyclic matrices
- Smith normal form and acyclic matrices
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- On the eigenvalues of generalized and double generalized stars
Cited In (9)
- Graphs that allow all the eigenvalue multiplicities to be even
- Unbalanced subtrees in binary rooted ordered and un-ordered trees
- An explicit upper bound on disparity for trees of a given diameter
- Acyclic matrices with a small number of distinct eigenvalues
- Spectral arbitrariness for trees fails spectacularly
- 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
- Unordered multiplicity lists of wide double paths
- CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
This page was built for publication: Unordered multiplicity lists of a class of binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389635)