Graphs with exactly one hamiltonian circuit
J. Sheehan · Journal of Graph Theory · 1977
Abstract Let h(n) be the largest integer such that there exists a graph with n vertices having exactly one Hamiltonian circuit and exactly h(n) edges. We prove that h(n) = [n2/4]+1 (n ≧ 4) and discuss some related problems.