On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
From MaRDI portal
Publication:931031
DOI10.1007/s10231-007-0044-3zbMath1144.15003OpenAlexW2153360654MaRDI QIDQ931031
Publication date: 24 June 2008
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10231-007-0044-3
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
The maximum number of P-vertices of some nonsingular double star matrices, Nonsingular acyclic matrices with full number of P-vertices, On the number of P-vertices of some graphs, The acyclic matrices with a P-set of maximum size, On the rank spread of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc coverings of graphs
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Matching theory
- Path coverings of the vertices of a tree
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Algebraic matching theory
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Mechanical vibration trees
- Theory of monomer-dimer systems
- Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
- Matrix Analysis
- The Determinant of the Adjacency Matrix of a Graph
- 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