The clique number and the smallest Q-eigenvalue of graphs

Leonardo de Lima, Vladimir Nikiforov, Carla Oliveira

Let $q_{\min }(G)$ stand for the smallest eigenvalue of the signless Laplacian of a graph $G$ of order $n.$ This paper gives some results on the following extremal problem: How larg…