The least signless Laplacian eignvalue of the complements of unicyclic graphs

摘要

Let Snc be the set of all connected graph each of which is a complement of an n-vertex unicyclic graph. Li and Wang (2012) determined the graphs with the least signless Laplacian eignvalue among all the graphs of the complements of n-vertex trees. In this paper, as a continuance of it, the unique graph among Snc which minimizes the least signless Laplacian eigenvalue is identified.