Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Concept and Vocabulary Check - Page 921: 2


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)!$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

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.