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

Answer

These graphs cannot be equivalent because they do not look alike. This statement does not make sense.

Work Step by Step

These graphs cannot be equivalent because they do not look alike. This statement does not make sense. Equivalent graphs can be drawn in different ways and look very different from each other, but they are still equivalent graphs. As long as the number of vertices is the same, the number of edges is the same, and the edges connect the vertices in the same way, then the graphs are equivalent. It does not matter if the graphs look different from each other.
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.