Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - 14.1 Graphs, Paths, and Circuits - Exercise Set 14.1 - Page 900: 8

Answer

The two graphs in the question are equivalent. Both graphs have the same number of vertices and the vertices are connected by the edges in the same way. The graph below is also equivalent to the two graphs in the question.
1514091754

Work Step by Step

The two graphs in the question are equivalent. Both graphs have the same number of vertices and the vertices are connected by the edges in the same way. The vertices in both graphs are A, B, C, and D. The edges in both graphs are AB, AC, AD, BC, and BD. The graph below is also equivalent to the two graphs in the question. The vertices in the graph are A, B, C, and D. The edges in the graph are AB, AC, AD, BC, and BD.
Small 1514091754
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.