Opening book details…
Can I read Ordering Trees by Their Largest Eigenvalues on EtoBox?
Ordering Trees by Their Largest Eigenvalues by An Chang; Qiongxiang Huang is a Mathematics article available to read on EtoBox.
What is Ordering Trees by Their Largest Eigenvalues about?
The set of trees with n vertices is denoted by T n . Hofmeister has determined the first five values of the largest eigenvalue of trees in T n and the corresponding trees for these values [Linear Algebra Appl. 260 (1997) 43]. In other words, an order of the first five trees in T n by their largest eigenvalues has been given. Focus on the same purpose, we shall give a partition for trees in T n first in the this paper and then extend this order to the eighth tree.
Who reads Ordering Trees by Their Largest Eigenvalues?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- An Chang; Qiongxiang Huang
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0024-3795)
- Published
- 2003
- Language
- EN
- Field
- Mathematics (Physical Sciences)