A characterization of the non-trivial diameter two graphs of minimum size

Let GG be a graph with diameter two, order nn and size mm, such that no vertex is adjacent to every other vertex. A classical result due to Erdős and Rényi (1962) states that m≥2n−5m≥2n−5. We characterize the graphs that achieve equality in the Erdős–Rényi bound.