华东师范大学学报(自然科学版) ›› 2012, Vol. 2012 ›› Issue (4): 18-26.

• 数学 • 上一篇    下一篇

有关连通图谱半径的一些可达下界

龚和林   

  1. 上饶师范学院~~数学与计算机科学学院, 江西~~上饶 334001
  • 收稿日期:2011-08-01 修回日期:2011-11-01 出版日期:2012-07-25 发布日期:2014-12-15

Some sharp lower bounds for spectral radius of connected graphs

GONG He-lin   

  1. School of Mathematics and Computer Science, Shangrao Normal University, Shangrao Jiangxi 334001, China
  • Received:2011-08-01 Revised:2011-11-01 Online:2012-07-25 Published:2014-12-15

PDF

2460

摘要： 讨论连通简单图的谱半径的下界问题. 证明了关于途径数的一个不等式, 进而利用最大、最小度、平均度、2-度和$k$-途径数给出图的谱半径一些新的下界. 再运用相 似矩阵特性与\,Weyl\,不等式, 并利用途径数得到图谱半径的另一下界. 同时刻画了上述下界的全部极值图.

关键词: 邻接矩阵, 谱半径, Perron 特征向量, 下界

Abstract: This paper studied lower bounds on the spectral radius of connected simple graphs and proved an useful inequality for the number of walks. Furthermore, some new lower bounds on the spectral radius of graphs were provided in terms of the maximum and minimum degree, the average degree, the 2-degree and the number of $k$-walks(with $k$ vertexes). By applying the properties of similar matrices and the Weyl inequalities,  another lower bound was obtained by means of the number of $k$-walks.  Simultaneously, all extremal graphs which achieve above bounds were also characterized.

Key words: adjacency matrix, spectral radius, Perron eigenvector, lower bound

中图分类号: