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, the first three largest spectral radii in the class B（n） （n ≥9） together with the corresponding graphs are given.
