Abstract
The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ℐ n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ℐ n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al.
Original language | English |
---|---|
Pages (from-to) | 2021-2032 |
Number of pages | 12 |
Journal | Acta Mathematica Sinica, English Series |
Volume | 28 |
Issue number | 10 |
DOIs | |
Publication status | Published - Sept 2012 |
Scopus Subject Areas
- Mathematics(all)
- Applied Mathematics
User-Defined Keywords
- algebraic connectivity
- ordering
- Tree