Non-bipartite graphs of fixed order and size that minimize the least eigenvalue

In this paper we determine the unique graph with minimal least eigenvalue (of the adjacency matrix) within the set of connected graphs of fixed order n and size m  , whenever m=⌈n2⌉⌊n2⌋+a, where a   is a fixed integral constant in [1,⌈n2⌉−1].