# Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Exercise Set 14.3 - Page 923: 52

In a complete graph with $n$ vertices, the number of Hamilton circuits in the graph is given by the factorial expression $(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)!$.

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.