Article ID Journal Published Year Pages File Type
4650319 Discrete Mathematics 2008 15 Pages PDF
Abstract

A graph GG of order nn is called a bicyclic graph if GG is connected and the number of edges of GG is n+1n+1. Let B(n)B(n) be the set of all bicyclic graphs on nn vertices. In this paper, we obtain the first four largest Laplacian spectral radii among all the graphs in the class B(n)B(n) (n≥7n≥7) together with the corresponding graphs.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,