On the least Q-eigenvalue of a non-bipartite hamiltonian graph

In this paper, we study the least Q-eigenvalue of a non-bipartite hamiltonian graph, and determine all non-bipartite hamiltonian graphs whose least Q-eigenvalue attains the minimum among all non-bipartite hamiltonian graphs on n vertices.