n阶双圈图的邻接谱半径

On the spectral radius of bicyclic graphs of order n

何常香等人通过对双圈图进行收缩、夺邻、嫁接等运算,找出了双圈图中邻接半径前三大的图．并给出了它们的邻接谱半径．亓静在本文中考虑了点数n≥12的双圈图,推广了上述结论,找出了双圈图中前五大邻接谱半径,并给出了相应的双圈图．

In the paper [11], by using the methods of contracting, moving neighbors and grafting, the author has determined the first three largest spectral radii of all bieyclic graphs on n vertices and the corresponding graphs. In this paper, we generalized the conclusions in [11] by giving the first five largest spectral radii of the bieyelic graphs on n ≥ 12 vertices together with the corresponding bicyclic graphs.