n阶图G称为是一个单圈图,如果G是连通的,并且G的边数也是n.用u(n)表示所有n阶单圈图所成的集合.给出了当阶数n≥25时,代数连通度为前九大的n阶单圈图及它们的代数连通度.
A graph G of order n is called a unicyclic graph if G is connected and the number of edges of G is also n . Let u(n) be the set of all unicyclic graphs on n vertices. In this paper, the algebraic connectivity of first nine largest n-order graphs in the class u(n) (n≥25) together with the corresponding graphs are obtained.