Estimates on the size of the cycle spectra of Hamiltonian graphs

Given a graph $G$, let $S\left(G\right)$ be the set of all cycle lengths contained in $G$ and let $s\left(G\right)=\left|S\left(G\right)\right|$. Let $?\left(G\right)=\{3,\dots ,n\}?S\left(G\right)$ and let $d$ be the greatest common divisor of $n?2$ and all the positive pairwise differences of elements in $?\left(G\right)$. We prove that if a Hamiltonian graph $G$ of order $n$ has at least $\frac{n(p+2)}{4}+1$ edges, where $p$ is an integer such that $1\le p\le n?2$, then $s\left(G\right)\ge p$ or $G$ is exceptional, by which we mean $d?(??2)$ for some $?\in ?\left(G\right)$. We also discuss cases where $G$ is not exceptional, for example when $n?2$ is prime. Moreover, we show that $s\left(G\right)\ge min\{p,\frac{n?3}{2}\}$, which if $G$ is bipartite implies that $s\left(G\right)\ge min\{?\frac{4(m?1)}{n}?2?,\frac{n?2}{2}\}$, where $m$ is the number of edges in $G$.