文献类型：期刊文献

英文题名：Six classes of trees with largest normalized algebraic connectivity

作者：Li, Jianxi[1,2];Guo, Ji-Ming[3];Shiu, Wai Chee[4];Chang, An[2]

机构：[1]Minnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R China;[2]Fuzhou Univ, Ctr Discrete Math, Fuzhou 350002, Fujian, Peoples R China;[3]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China;[4]Hong Kong Baptist Univ, Dept Math, Kowloon Tong, Hong Kong, Peoples R China

年份：2014

卷号：452

起止页码：318

外文期刊名：LINEAR ALGEBRA AND ITS APPLICATIONS

收录：;EI(收录号：20141817681573);WOS:【SCI-EXPANDED(收录号:WOS:000336693300020)】；

基金：Partially supported by NSF of China (Nos. 11101358, 61379021, 11371372); NSF of Fujian (Nos. 2011305014, 2011301026, 2012D140); Project of Fujian Education Department (Nos. JA11165, JA12208, JA12209); Postdoctoral Foundation of Fuzhou University; General Research Fund of Hong Kong (No. 601016); Faculty Research Grant of Hong Kong Baptist University (No. HKBU202413).

语种：英文

外文关键词：Normalized algebraic connectivity; Tree

摘要：The normalized algebraic connectivity of a graph G, denoted by lambda(2) (G), is the second smallest eigenvalue of its normalized Laplacian matrix. In this paper, we firstly determine all trees with lambda(2) (G) >= 1 - root 6/3. Then we classify such trees into six classes L-1, . . ., L-6 and prove that lambda(2)(T-i) > lambda(2) (T-j) for 1 <= i <= j <= 6, where T-i is an element of L-i and T-j is an element of L-j. At the same time, the values of the normalized algebraic connectivity for the six classes of trees are provided, respectively. These results are similar to those on the algebraic connectivity which were obtained by Yuan et al. (2008) [8]. (C) 2014 Elsevier Inc. All rights reserved.