1 .		Vertex A is adjacent to
2 .		The degree of vertex D is
3 .		The degree of vertex C is
4 .		Which of the following 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 .		Which of the graphs has an Euler circuit?
8 .		Which of the graphs has an Euler path but no Euler circuit?
9 .		Questions 9 to 11 refer to the following situation: An undercover police officer is assigned the job of walking once a night each of the 48 blocks of a certain section of town described by the street grid shown below. The walk starts and ends at A. The officer wants to minimize the total number of blocks he has to walk each night. How many vertices of odd degree are there in the graph representing this problem?
10 .		An optimal eulerization of the graph representing this problem can be obtained by adding
11 .		Suppose that it takes the officer 5 minutes to walk a block. In an optimal trip, the officer will cover the entire neighborhood in
12 .		A graph has an Euler circuit if
13 .		A graph with 11 vertices has an Euler path but no Euler circuit. The graph must have
14 .		A graph has six vertices—two vertices of degree 4, two vertices of degree 3, and two vertices of degree 2. The number of edges in the graph is
15 .		The basic rule in Fleury’s algorithm is
Answer choices in this exercise are randomized and will appear in a different order each time the page is loaded.