Discrete Math

General:

· Before beginning this homework, be sure to read the textbook readings and the module notes.

· For additional practice, each homework problem has some ungraded examples and sample problems from the text that you can review, and they directly correspond with your graded homework. Work on those problems if needed, and post your questions to this week’s ungraded discussion forum.

· Work within this document for your homework, and be sure to show all steps for arriving at your solution.

Section 8.1 Homework

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

E = {e1, e2, e3, e4, e5}, and (e1) = {v,w}, (e2) = {t,u}, (e3) = {u,v}, (e4) = {v,w},

(e5) = {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.