摘要
根据全通道双圈图具有任意圈中不存在度小于3的顶点的性质,利用邻接矩阵,得到了所有含n个向量的全通道双圈图中谱半径最大的图,并判定了其存在的唯一性.
A fully loaded bicyclic graph is a bicyclic graph with the property that there is no vertex with degree less than 3 in its cycles. In this paper, we determine the unique graph with the largest spectral radius with respect to the adjacency matrix among all the fully loaded bicyclic graph with n vertices.
出处
《中南民族大学学报(自然科学版)》
CAS
2010年第4期101-106,共6页
Journal of South-Central University for Nationalities:Natural Science Edition
基金
中南民族大学中央高校基本科研业务费专项资金资助项目(ZZZ10005)