论文信息 - On the Laplacian spectral radii of bicyclic graphs

On the Laplacian spectral radii of bicyclic graphs

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 B(n) be the set of all bicyclic graphs on n vertices. In this paper, we obtain the first four largest Laplacian spectral radii among all the graphs in the class B(n) (n>=7) together with the corresponding graphs.

Jia-Yu Shao | Jin-Ling He | Chang-Xiang He

[1] Feng Tian,et al. On the index of bicyclic graphs with perfect matchings , 2004, Discret. Math..

[2] Ji-Ming Guo,et al. The Laplacian spectral radius of a graph under perturbation , 2007, Comput. Math. Appl..

[3] Feng Tian,et al. On the spectral radius of unicyclic graphs with perfect matchings , 2003 .

[4] Wai Chee Shiu,et al. On the second largest Laplacian eigenvalues of graphs , 2005 .

[5] On the spectral radius of bicyclic graphs , 2005 .

[6] Zhang Xiaodong,et al. A new upper bound for eigenvalues of the laplacian matrix of a graph , 1997 .

[7] Ji-Ming Guo. On the second largest Laplacian eigenvalue of trees , 2005 .

[9] R. Merris. Laplacian matrices of graphs: a survey , 1994 .

[10] Mei Lu,et al. Ordering trees by their Laplacian spectral radii , 2005 .

[11] Ji-Ming Guo,et al. The effect on the Laplacian spectral radius of a graph by adding or grafting edges , 2006 .