全通道双圈图的谱半径(英文)

Spectral Radius of Fully Loaded Bicyclic Graphs

根据全通道双圈图具有任意圈中不存在度小于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.