The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closed-form formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges.
['Ruud H. Teunter', 'Edo S. van der Poort']
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges