# MAT 230 Section 8.1 Homework

1) Draw a picture of the graph *G* = (*V*, *E*, g) where *V* = {t, u, v, w, z},

*E* = {e_{1}, e_{2}, e_{3}, e_{4}, e_{5}}, and g(e_{1}) = {v,w}, g(e_{2}) = {t,u}, g(e_{3}) = {u,v}, g(e_{4}) = {v,w},

g(e_{5}) = {t,v}

This problem is similar to examples 1 and 2 and problems 8.1.7 and 8.1.8.

**Section 8.2 Homework**

** **

1) Does the following graph have an Euler circuit, an Euler path, both, or neither? Give reasons for your decision. This problem is similar to examples 4 and 5 and problems 8.2.1–8.2.8.

2) Does the following graph have an Euler circuit, an Euler path, both, or neither? Give reasons for your decision. This problem is similar to examples 4 and 5 and problems 8.2.1–8.2.8.

3) Use Fleury’s algorithm to produce an Euler circuit for the following graph. Start at A and label the edges in the order that you add them. This problem is similar to example 6 and problems 8.2.11 and 8.2.12.