Further Maths - Hamiltonian Cycles
See Also
Flashcards
What is a Hamiltonian cycle?
A cycle that visits all the vertices of a graph.
How many times should a Hamiltonian cycle visit a vertex?
Just one, apart from at the end.
What must be true about the start and end vertex of a Hamiltonian cycle?
It must be the same.
What is the formula for the number of Hamiltonian cycles for a complete graph $K _ n$?
\[\frac{(n - 1)!}{2}\]