The lower bound of the second largest Laplacian eigenvalue on unicyclic graph

摘要：

A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Let Un be the set of all unicyclic graphs of order n. Guo 4 determined the trees with the first, second and third smallest of the second largest Laplacian eigenvalue of trees, meanwhile he gave a attainable upper bound of the second largest Laplacian eigenvalue of trees. In this paper, we give the lower bound of the second largest Laplacian eigenvalue in Un and determine the graph class attaining the lower bound.

关键词： Unicyclic graph girth Laplacian eigenvalue

作者: Ying Liu Shuangcheng Wang

作者单位: College of Mathematics and Information,Shanghai Lixin University of Commerce Shanghai, 201620, China

会议类型: 国际会议

会议名称: 2011 International Conference on Economic and Information Management(2011年经济与信息管理国际会议 ICEIM 2011)

会议地点: 北京

会议语种:英文

页码: 34-36

在线出版日期: 2011-09-03（万方平台首次上网日期，不代表论文的发表时间）