Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 10 - Graphs and Trees - Exercise Set 10.1 - Page 639: 5

Answer

The graph is:

Work Step by Step

Count the degree of each of the vertices in the left-hand and right-hand drawings, then match the vertices according to degree. $v_5$ is the only vertex with degree 1. Hence we know it must be the top most point in the right-hand drawing that also has degree 1. Then match vertices that are adjacent to $v_5$.
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.