#### Answer

complete, $(n-1)!$

#### Work Step by Step

A graph that has an edge between each pair of its vertices is called a complete graph. If such a graph has $n$ vertices, the number of Hamilton circuits in the graph is given by the factorial expression $(n-1)!$.