## Thinking Mathematically (6th Edition)

This complete graph has 4 vertices. We know that the number of Hamilton circuits in a complete graph with $n$ vertices is $(n-1)!$. The number of Hamilton circuits in this graph is $(4-1)!$ which is $3!$. Since $3! = 6$, this graph has 6 Hamilton circuits.