The tree with second largest Laplacian Spread

摘要：

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of its Laplacian matrix. In this paper, we determine the unique tree with second largest Laplacian spread among all trees of given order.

关键词： Kcywords: Tree Laplacian matriz Spread

作者: Shi-Cai Gong Yi-Zheng Fan Zhi-Xiang Yin

作者单位: School of Mathematical Sciences, Anhui University, Hefei, 230039,School of Science, Anhui University School of Mathematical Sciences, Anhui University, Hefei, 230039 School of Science, Anhui University of Science and Technology, Huainan, 232001

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 436-439

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