1 .		Questions 1 through 6 refer to the graph in Figure 5.1. Vertex E is adjacent to
2 .		The degree of vertex D is
3 .		The degree of vertex C is
4 .		Which of the following [A), B), C), or D)] is not a path from vertex D to vertex A?
5 .		Which of the following [A), B), C), or D)] is not a circuit in the graph?
6 .		Which of the following is a bridge of the graph?
7 .		Questions 7 and 8 refer to the graph with vertices A, B, C, D, E and edges BC, CE, AB, AC, and BD. The degree of vertex B is
8 .		Which of the following is a bridge of the graph?
9 .		Questions 9 through 11 refer to the four graphs in Figure 5.2. Which graph has an Euler circuit?
10 .		Which graph(s) are disconnected?
11 .		Which graph has an Euler path but no Euler circuit?
12 .		Questions 12 and 13 refer to the four drawings in Figure 5.3. Which of the drawings has an open unicursal tracing?
13 .		Which of the drawings has a closed unicursal tracing?
14 .		A graph has seven vertices–two vertices of degree 6, four vertices of degree 5, and one vertex of degree 2. The number of edges in the graph is
15 .		In a certain city there is a river running through the middle of the city. There are four islands and nine bridges as shown in Figure 5.4.
Answer choices in this exercise are randomized and will appear in a different order each time the page is loaded.