5
$\begingroup$

I would like to know information regarding the function $h(n)$ where $h(n)$ is the number of hamiltonian cycles the graph $K_n$ has after removing the edges that make up a hamiltonian cycle of $K_n$. Thank you very much in advance.

Regards.

$\endgroup$

1 Answer 1

8
$\begingroup$

This is sequence A002816 at OEIS. You can find a recurrence and asymptotic expansion there.

There is a summation for it in this old Stanford research report (end of page 6).

$\endgroup$
0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.