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 - Exercise Set 14.3 - Page 921: 8


The path F,G,E,C,B,A,D,F is a Hamilton circuit that begins at F and ends with the pair of vertices D,F.

Work Step by Step

A Hamilton path is a sequence of adjacent vertices that visits each vertex in the graph exactly once. A Hamilton circuit is a Hamilton path that begins and ends at the same vertex. Let's start at vertex F. Note that moving to vertex G must be the first step, otherwise the path will get "stuck" at vertex G if we try to move there from vertex E. The path must travel from vertex F to vertex G, then to vertex E, then to vertex C, then to vertex B, then to vertex A, then to vertex D, and then finally to vertex F. This path is F,G,E,C,B,A,D,F. Since this path visits every vertex in the graph exactly once (except for vertex F which is the starting and ending vertex), this path is a Hamilton path. Since this Hamilton path starts and ends at the same vertex, this path is a Hamilton circuit. This is the only Hamilton circuit in the graph that begins at vertex F and ends with the pair of vertices D,F.
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.