n阶三圈图的补图的谱半径  

Spectral radius of the complement of tricyclic graphs with n vertices

作　　者：尹连伟[1] 郭曙光[2] 

机构地区：[1]淮安市徐杨中学,江苏淮安223001 [2]盐城师范学院数学科学学院,江苏盐城224002

出　　处：《高校应用数学学报（A辑）》2011年第2期223-229,共7页Applied Mathematics A Journal of Chinese Universities(Ser.A)

基　　金：江苏省自然科学基金(BK2010292)

摘　　要：三圈图是边数等于顶点数加2的简单连通图.在所有n阶三圈图的补图中,哪一个的谱半径最大?文中给出了n阶三圈图的补图的谱半径的上界,并刻画了唯一的达到该上界的图.Tricyclic graphs are connected graphs in which the number of edges equals the number of vertices plus two.In this paper the following problem is considered： Among all complement of tricyclic graphs with nvertices,which one has the maximum spectral radius？ The upper bound of spectral radius of all the complement of tricyclic graphs is given and the unique graph which reaches this upper bound is determined.

关 键 词：三圈图 补图 邻接矩阵 谱半径 

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