On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (Q931031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5292345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree |
scientific article; zbMATH DE number 5292345 |
Statements
On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (English)
0 references
24 June 2008
0 references
The author gives alternative and simpler proofs of some results of \textit{C. R. Johnson} and \textit{A. L. Duarte} [Linear Multilinear Algebra 46, No. 1--2, 139--144 (1999; Zbl 0929.15005)] and \textit{C. R. Johnson} and \textit{C. M. Saiago} [Electron J. Linear Algebra 9, 27--31 (2002; Zbl 0999.15005)] on the minimum number of vertex disjoint paths, occuring as induced subgraphs of a tree \(T\), which cover all the vertices of \(T\). The approach is based on classic results of \textit{O. J. Heilmann} and \textit{E. H. Lieb} [Commun. Math. Phys. 25, 190--232 (1972; Zbl 0228.05131)] from the theory of matching polynomials.
0 references
eigenvalues
0 references
graph
0 references
tree
0 references
symmetric matrices
0 references
vertex degrees
0 references
0 references
0 references
0 references
0 references
0.8379430770874023
0 references
0.8306740522384644
0 references
0.821566641330719
0 references
0.8177748322486877
0 references
