Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 146: 36b

Answer

(i) This graph have an Euler path, A->C->B->D->A->E->B->F->A (ii) This graph does not have an Euler path. (iii) This graph have an Euler path, D->A->E->B->D->C->A->F->B->C

Work Step by Step

In first graph all nodes have even degree hence it does have an Euler path, In second graph there are 4 nodes with odd degree hence it does not have an Euler path, In third graph there are 2 nodes with odd degree hence it has an Euler path. (i) This graph has an Euler path, A->C->B->D->A->E->B->F->A (ii) This graph does not have an Euler path. (iii) This graph has an Euler path, D->A->E->B->D->C->A->F->B->C
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.