The Sharp Lower Bound of the Least Eigenvalue of a Bicyclic Graph

Abstract

Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. In this paper, we determine the first three graphs among all bicyclic graphs with \(n\) vertices, ordered according to their least eigenvalues in increasing order.