A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Let G be a simple graph with n vertices, and let λ n G be the least eigenvalue of G. The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, the first five unicyclic graphs on order n in terms of their smaller least eigenvalues are determined.doi:10.1155/2010/591758 fatcat:s47b5hwezjahvcdlqzxyz6lxle