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: 6


These two graphs are equivalent.

Work Step by Step

These two graphs 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 AD, BC, DC, BB, and DB. These are two ways to draw these equivalent graphs, but note that there are other ways to draw these equivalent graphs also.
Small 1514090373
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.