Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 5 - Section 5.3 - Recursive Definitions and Structural Induction - Exercises - Page 359: 40

Answer

number of edges=7

Work Step by Step

As here degree of five vertices is given so we will use: 2(number of edges)=sum of all the degrees of a graph 2(number of edges)=4+3+3+2+2 number of edges=14/2 number of edges=7 in graph there will be seven edges and five vertices.
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.