Department of Mathematics
The smallest values of algebraic connectivity for trees
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. © 2012 Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg.
algebraic connectivity, ordering, Tree
Source Publication Title
Acta Mathematica Sinica, English Series
Link to Publisher's Edition
Li, Jian Xi, Ji Ming Guo, and Wai Chee Shiu. "The smallest values of algebraic connectivity for trees." Acta Mathematica Sinica, English Series 28.10 (2012): 2021-2032.