Back to Search
Start Over
Upper Bounds on the Smallest Positive Eigenvalue of Trees.
- Source :
-
Annals of Combinatorics . Mar2023, Vol. 27 Issue 1, p19-29. 11p. - Publication Year :
- 2023
-
Abstract
- In this article, we undertake the problem of finding the first four trees on a fixed number of vertices with the maximum smallest positive eigenvalue. Let T n , d denote the class of trees on n vertices with diameter d. First, we obtain the bounds on the smallest positive eigenvalue of trees in T n , d for d = 2 , 3 , 4 and then upper bounds on the smallest positive eigenvalue of trees are obtained in general class of all trees on n vertices. Finally, the first four trees on n vertices with the maximum, second maximum, third maximum and fourth maximum smallest positive eigenvalue are characterized. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*TREES
Subjects
Details
- Language :
- English
- ISSN :
- 02180006
- Volume :
- 27
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Annals of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 162322400
- Full Text :
- https://doi.org/10.1007/s00026-022-00619-x