
## Section2.4Exercises

###### 1

The questions in this exercise pertain to the graph $\bfG$ shown in Figure 2.4.3.

1. What is the degree of vertex $8\text{?}$

2. What is the degree of vertex $10\text{?}$

3. How many vertices of degree $2$ are there in $\bfG\text{?}$ List them.

4. Find a cycle of length $8$ in $\bfG\text{.}$

5. What is the length of a shortest path from $3$ to $4\text{?}$

6. What is the length of a shortest path from $8$ to $7\text{?}$

7. Find a path of length $5$ from vertex $4$ to vertex $6\text{.}$

###### 2

Draw a graph with $8$ vertices, all of odd degree, that does not contain a path of length $3$ or explain why such a graph does not exist.

###### 3

Find an eulerian circuit in the graph $\bfG$ in Figure 2.4.4 or explain why one does not exist.

###### 4

Consider the graph $\bfG$ in Figure 2.4.5. Determine if the graph is eulerian. If it is, find an eulerian circuit. If it is not, explain why it is not. Determine if the graph is hamiltonian. If it is, find a hamiltonian cycle. If it is not, explain why it is not.