20 CHAPTER 3.

GRAPH THEORY

Name:
For each graph below:
1. Write the degrees of each vertex.
2. Determine if the graph contains an Euler trail, and Euler circuit, or neither.
3. If an Euler path or Euler circuit exists, give it down (e.g. abcdae)
20 CHAPTER 3. GRAPH THEORY

ANSWER:

 The degrees of each vertex

vertex a. 4 vertex d. 4 vertex g. 4
vertex b. 4 vertex e. 4 vertex h. 4
vertex c. 4 vertex f. 2 vertex i. 2
 Determine if the graph contains an Euler trail, and Euler circuit, or neither.
The graph contains both Euler circuit and Euler Trail
 If an Euler path or Euler circuit exists, give it down. FOR EXAMPLE
• abeafegdbcihcdhga
• abcdhichgdbegafea
• abcdhichgdbegaefa
• bdgebaefaghdchicb

 The degrees of each vertex

vertex a. 2 vertex d. 4
vertex b. 2 vertex e. 4
vertex c. 2
 Determine if the graph contains an Euler trail, and Euler circuit, or
neither.
The graph contains both Euler trail and Euler circuit
 If an Euler path or Euler circuit exists, give it down.
FOR EXAMPLE
 adcebdea
 adecdbea
 aebdecda
 bdaecdeb
20 CHAPTER 3. GRAPH THEORY

 The degrees of each vertex

vertex a. 4 vertex d. 4
vertex b. 4 vertex e. 3
vertex c. 3
 Determine if the graph contains an Euler trail, and Euler circuit, or neither.
The graph contains both Euler trail and Euler circuit
 If an Euler path or Euler circuit exists, give it down. FOR EXAMPLE
 edcebdabac

 The degrees of each vertex

vertex a. 4 vertex d. 4
vertex b. 4 vertex e. 4
vertex c. 4
 Determine if the graph contains an Euler trail, and Euler circuit, or neither.
The graph contains both Euler trail and Euler circuit
 If an Euler path or Euler circuit exists, give it down. FOR EXAMPLE
 abcebedcada
 bacdadecbeb
 acedcbebada
 bcdecadabeb