圈不交的双圈图的距离谱半径(英文)  

Distance Spectral Radius of Bicyclic Graphs with Disjoint Cycles

作　　者：朱忠熏[1] 罗婧[1] 卢鸿艳 

机构地区：[1]中南民族大学数学与统计学学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2014年第2期123-126,共4页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家自然科学基金资助项目(61370107);中南民族大学研究生学术创新项目

摘　　要：图G的距离谱半径ρ(G)是图G的距离矩阵的最大特征值.本文利用线性代数和图论的方法,先给出了一些使距离谱半径递减的图变换,然后利用这些变换确定了圈不交的双圈图中距离谱半径最小的极值双圈图,同时,给出了对应距离谱半径满足的三次方程.The distance spectral radius p（G） of a graph G is the largest eigenvalue of the distance matrix D（G）. In this paper, by the methods of linear algebra and graph theory, we first give some graph transformations which decrease the distance spectral radius. Then by these graph transformations, we determine the extremal bicyclic graph which has minimal distance spectral radius in the class of bicyclic graphs with disjoint cycles, at the same time, the cubic equation on the corresponding distance spectral radius is given.

关 键 词：距离矩阵 距离谱半径 双圈图 

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