The Second Smallest Eigenvalue of a tree

摘要：

Let G be a simple graph with adjacency matrix AG. Suppose D is The diagonal matrix with the degrees of G on the diagonal (with the same vertex ordering as in AG). Then LG = D - AG is the Laplacian matrix of G (often abbreviated to the Laplacian, and also known as admittance matrix), In thispaper, we discuss the relationship between the second smallest eigenvalue andthe diameter of a tree, we also obtain a lower bound for the second smallest of a tree.

关键词： Laplacian matriz eigenvalues the second-smallest diameter

作者: Houqing Zhou

作者单位: Department of Mathematics, Shaoyang University, Hunan, 422000,P.R.China

会议类型: 国际会议

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

会议地点: 杭州

会议语种:英文

页码: 1453-1454

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