Thinking Mathematically (6th Edition)

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

Chapter 10 - Geometry - Chapter Summary, Review, and Test - Review Exercises - Page 683: 67

Answer

The graph is not traversable.

Work Step by Step

It is required to evaluate the traversable path of the given graph. The graph has 4 odd vertices such as A, B, C, and D. The graph is traversable when the graph doesn’t have more than two odd vertices. In the given graph, there are more than two odd vertices, so it is clear that the graph is not traversable. Hence, the graph is not traversable.
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.