关于双圈图的谱半径

On the Spectral Radii of Bicyclic Graphs

中文关键词:  双圈图  谱半径  特征多项式.

英文关键词:bicyclic graph  spectral radius  characteristic polynomial.

中文摘要:

      如果 $G$ 是连通的并且 $G$ 的边数是 $n+1$, 那么$n$阶图$G$ 叫做双圈图. 设${\cal B}(n)$ 是所有的阶为 $n$ 的双圈图构成的集合. 本文给出了${\cal B}(n)~(n\geq 9)$中前三大的邻接谱半径以及它们对应的图.

英文摘要:

      A graph $G$ of order $n$ is called a bicyclic graph if $G$ is connected and the number of edges of $G$ is $n+1$. Let ${\cal B}(n)$ be the set of all bicyclic graphs on $n$ vertices. In this paper, the first three largest spectral radii in the class ${\cal B}(n)$~($n\geq 9$) together with the corresponding graphs are given.