Chapter 5, Problem 29E

In Exercise 29 through 34 choose from the following answers and provide a short explanation for your answer using Euler’s theorems.

A. the graph has an Euler circuit.

B. the graph has Euler path.

C. the graph has neither an Euler circuit nor an Euler path.

D. the graph may or may not have an Euler circuit.

E. the graph may or may not have an Euler path.

F. there is no such graph.

a. $\underset{\_}{Fig.5-41\left(a\right)}$

b. $\underset{\_}{Fig.5-41\left(b\right)}$

c. A connected graph with eight vertices, all of degree 2

d. A graph with 8 vertices, all of degree 2. (Hint: See Exercise 9).

e. A connected graph with eight vertices: three vertices of degree 2 and five vertices of degree 3.

Figure $5-41$

Exercises 9