The least eigenvalue of graphs whose complements are unicyclic

Yi Wang, Yi-Zheng Fan, Xiao-Xin Li +1

A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\it et…