On the Minimum Number of Hamiltonian Cycles in Regular Graphs

Michael Haythorpe

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such…