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 902: 55

Answer

Two graphs are equivalent if the graphs have the same number of vertices and the same number of edges, and pairs of vertices are connected by the edges in the same way in both graphs.

Work Step by Step

We can write a simple explanation for equivalent graphs as follows: Two graphs are equivalent if the graphs have the same number of vertices and the same number of edges, and pairs of vertices are connected by the edges in the same way in both graphs.
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.