Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues

Guang-Hui Xu
2010 Journal of Inequalities and Applications  
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