Imagine a very large connected graph that has two odd vertic

Imagine a very large connected graph that has two odd vertices and 398 even vertices.

           a)         Does a Euler path exist for this graph? Explain.

           b)         Does an Euler circuit exist for this graph? Explain.

Solution

a) yes

explanation : eular theorem 2 in konigsberg bridge problem

b) no

explanation : eular theorem 1 in konigsberg bridge problem.

EULER