非正则图的最大特征值  

On the largest eigenvalue of nonregular graphs

作　　者：扈生彪[1] 

机构地区：[1]青海民族学院数学系,青海西宁810007

出　　处：《纯粹数学与应用数学》2009年第1期47-50,共4页Pure and Applied Mathematics

基　　金：国家自然科学基金(10861009).

摘　　要：通过对图的最大特征分量与顶点度之间的关系的刻画,得到了图的谱半径与参数最大度和次大度之间的不等关系,进而获得了简单连通非正则图的谱半径的若干上界.In this paper, we describe that the relation between the highest eigencomponent and the vertex degree of graph, and we get the inequality relation between the spectral radius of graphs and the largest vertex degree and the second largest vertex degree. Moreover, we get some the upper bounds of spectral radius of simple connected non-regular graphs.

关 键 词：非正则图 邻接矩阵 最大特征值 

分 类 号：O157.5[理学—数学]