On the Largest Eigenvalue of Signless Laplacian Matrix of Halin Graphs

摘要：

Let G be a Halin graph, its signless Laplacian matrix K(G) is the sum of the diagonal matrix of its vertex degrees and its adjacency matrix. Let/A (G) be the largest eigenvalue of K(G), In this paper we obtain the following results: 1. Let G be a Haalin graph on n vertices and suppose G has α inner vertices, then μ(G)≤n-2α+6+(√)(n-2α-2)2+16/2 2. Let G be a Halin graph on n vertices, thenμ(G)≤n+4+(√)(n-4) 2+16/2, and equality holds if and only if G is a wheel.

关键词： Halin graph Eigenvalue Signless Laplacian matrix

作者: Xiaoxin Zhu Yajuan Wu

作者单位: College of Mathematics and Physics,Nanjing University of Information Science and Technology, Nanjing 210044, China

会议类型: 国际会议

会议名称: 2010 International Conference on Application of Mathematics and Physics(2010国际数理科学与气象学术研讨会暨2010空间天气学研讨会 AMP2010)

会议地点: 南京

会议语种:英文

页码: 481-484

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