On graphs with exactly three Q-eigenvalues at least two

For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenvalues. By considering the relation between the Q-spectrum and the circumference of G, we characterize all connected graphs with exactly three Q-eigenvalues at least two.