Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 10 - Section 10.2 - Graph Terminology and Special Types of Graphs - Exercises - Page 665: 2

Answer

no. of vertices= 5 no. of edges= 13 degree of vertex a = 5 degree of vertex b = 6 degree of vertex c = 5 degree of vertex d = 5 degree of vertex e = 3 there is no pendent and isolated vertices

Work Step by Step

no of vertices in graph are 5 no of edges which connect one graph to another are 13 The degree of a vertex represents the number of edges incident to that vertex. degree of every vertices is written as degree of a is 5 and b is 6 so no as no vertex has one degree so there is no pendent vertex no vertex has zero degree so there is no isolated vertex
This answer is currently locked

Someone from the community is currently working feverishly to complete this textbook answer. Don’t worry, it shouldn’t be long.