The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

We prove that the minimum number of Hamilton cycles in a Hamiltonian threshold graph of order n is 2 ⌊ ( n − 3 ) ∕ 2 ⌋ and this minimum number is attained uniquely by the graph with degree sequence n − 1 , n − 1 , n − 2 , … , ⌈ n ∕ 2 ⌉ , ⌈ n ∕ 2 ⌉ , … , 3,2 of n − 2 distinct degrees. This graph is also the unique graph of minimum size among all Hamiltonian threshold graphs of order n.