On the maximum number of cycles in a Hamiltonian graph (Q2576841)

Let \(M(k)\) denote the maximum number of cycles in a Hamiltonian graph of order \(n\) and size \(n+k.\) \textit{Y. Shi} [Discrete Math. 133, 249--257 (1994; Zbl 0810.05049)] proved that \(2^{k}+k(k-1)+1\leq M(k)\leq 2^{k+1}-1.\) In the present paper the values of \(M(k)\) for \(5\leq k\leq 10\) are determined and an improvment in the error term of Shi's bound is given.