  Bicyclic graph is a connected graph in which the number of edges equals the
number of vertices plus one. In this paper, we determine the graph which alone
maximizes the spectral radii among all the bicyclic graphs on $n$ vertices with
fixed independence number.
