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

广义并接图的无符号拉普拉斯谱半径
引用本文:吴雅容.广义并接图的无符号拉普拉斯谱半径[J].上海海事大学学报,2014,35(1):92-94.
作者姓名:吴雅容
作者单位:上海海事大学 文理学院
基金项目:国家自然科学基金(11226290,11271315)
摘    要:为研究图的无符号拉普拉斯谱半径的界,以图的顶点度di等为参数,通过对图的无符号拉普拉斯矩阵进行相似变换,证明由任意两个图G1和G2得到的广义并接图G的谱半径上确界q(G).由此刻画达到这个上界的极图当且仅当G1和G2均为正则图.

关 键 词:广义并接图    无符号拉普拉斯谱    谱半径
收稿时间:5/2/2013 12:00:00 AM
修稿时间:1/6/2014 12:00:00 AM

Signless Laplacian spectral radius of weak joining graphs
Institution:Shanghai Maritime University
Abstract:To research the bound of the signless Laplacian spectral radius of a graph, taking the vertex degree di and so on of the graph as parameters, by the similarity transformation of the signless Laplacian matrix of the graph, the sharp upper bound q(G) of the signless Laplacian spectral radius of the weak joining graph G is determined, where G is obtained by two random graphs G1 and G2. Based on this, the extremal graph reaching the upper bound is characterized if and only if G1 and G2 are regular graphs.
Keywords:weak joining graph  signless Laplacian spectrum  spectral radius
本文献已被 CNKI 等数据库收录!
点击此处可从《上海海事大学学报》浏览原始摘要信息
点击此处可从《上海海事大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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