The least eigenvalue of the signless Laplacian of the complements of trees

Let be the set of the complements of trees on n vertices. In this paper we characterize the unique graph whose least eigenvalue of the signless Laplacian attains the minimum among all graphs in , where is the complement of the star graph on n vertices.