HomeW9rk Problem httppuushoWV7Pd703a74687pngSolutionsolution

HomeW9rk Problem

http://puu.sh/oWV7P/d703a74687.png

Solution

solution (a)

If a graph has an Euler path, then it must have exactly two odd vertices.

or another way

If the number of odd vertices in graph is anything other than 2, then graph cannot have an Euler path.

hence

correct option is 2

solution(b)

in this graph

vertex degree odd/even

A 3 odd

B 3 odd

C 2 even

D 4 even

E 2 even

here, A and B complete the path so that it is Eluer path