首页 | 本学科首页   官方微博 | 高级检索  
     检索      

具有k个悬挂点的三圈图的谱半径
引用本文:李建喜,吴根良.具有k个悬挂点的三圈图的谱半径[J].漳州师院学报,2012(1):1-8.
作者姓名:李建喜  吴根良
作者单位:漳州师范学院数学与信息科学系,福建漳州363000
基金项目:国家自然科学基金项目(11101358); 福建省自然科学基金资助项目(2011J05014,2011J01026); 福建省教育厅资助科技项目(JA11165)
摘    要:边数等于顶点数加2的简单连通图称为三圈图.Rn(k)表示具有n个顶点k个悬挂点的所有三圈图所构成的集合.本文根据文献2]中对Rn(k)的分类,分别得到了各类三圈图中,达到其最大谱半径的极图.

关 键 词:悬挂点  三圈图  谱半径  极大特征向量

The Spectral Radius of Tricyclic Graphs with k Pendent Vertices
LI Jian-xi,WU Gen-liang.The Spectral Radius of Tricyclic Graphs with k Pendent Vertices[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2012(1):1-8.
Authors:LI Jian-xi  WU Gen-liang
Institution:(Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou, Fujian 363000, China)
Abstract:A simple connected graph in which the number of edges equals to the number of vertices plus two is called a tricyclic graph. Let Rn(k) be the set of all tricyclic graphs with n vertices and k pendent vertices. According to the classification on tricyclic graphs in the Reference, in this paper, the tricyclic graphs with maximum spectral radii among those classes of tricyclic graphs are determined respectively.
Keywords:pendant vertex  tricyclic graph  spectral radius  maximum eigenvector
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号