The spread of the unicyclic graphs

Let GG be a simple connected graph with nn vertices and nn edges which we call a unicyclic graph. In this paper, we first investigate the least eigenvalue λn(G)λn(G), then we present two sharp bounds on the spread s(G)s(G) of GG.