On the extremal number of edges in hamiltonian connected graphs

Assume that nn and δδ are positive integers with 3≤δ⌊n2⌋.