|
|||||
|
|
The smallest values of algebraic connectivity for trees |
|
| Authors: | Jian Xi Li Ji Ming Guo Wai Chee Shiu |
| Institution: | 1. Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou, 363000, P. R. China 2. Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, P. R. China 3. Department of Applied Mathematics, China University of Petroleum, Dongying, 257061, P. R. China |
| 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. |
| Keywords: | Tree algebraic connectivity ordering |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |