文献类型：期刊文献

英文题名：An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications

作者：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, Fujian, Peoples R China;[3]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China;[4]Hong Kong Baptist Univ, Dept Math, Hong Kong, Hong Kong, Peoples R China

年份：2014

卷号：171

起止页码：104

外文期刊名：DISCRETE APPLIED MATHEMATICS

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

基金：Partially supported by NSF of China (Nos. 11101358, 61379021, 11371372); NSF of Fujian (Nos. 2011J05014, 2011J01026); Project of Fujian Education Department (No. JA11165); Postdoctoral Foundation of Fuzhou University; General Research Fund of Hong Kong; Faculty Research Grant of Hong Kong Baptist University.

语种：英文

外文关键词：Second smallest normalized Laplacian eigenvalue; Edge-separating; Tree; Unicyclic graph

摘要：Let lambda(2) (G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we investigate the behavior on lambda(2) (G) when the graph G is perturbed by separating an edge. This result can be used to determine all trees and unicyclic graphs with lambda(2)(G) >= 1-root 2/2 Moreover, the trees and unicyclic graphs with lambda(2) (G) = 1-root 2/2 are also determined, respectively. (C) 2014 Elsevier B.V. All rights reserved.