For each graph below:

1. Write the degree of each vertex.

2. Determine if the graph contains an Euler trail, an Euler circuit, or neither.

3. If an Euler path or Euler circuit exists, give it down (e.g.,acbdae)

1. Degree of vertex 2. Euler Circuit 1. Degree of vertex

a= 4 f= 2 a= 2 d= 4
b= 4 g= 4 3. afebcihcdhgdbagea b= 2 e= 4
c= 4 h= 4 c= 2
d= 4 i= 2 2. Euler Circuit
e= 4
3. aecdebda

1. Degree of vertex 1. Degree of vertex

a= 4 d= 4 a= 4 d= 4
b= 4 e= 4 b= 4 e= 3
c= 4 c= 3

2. Euler Circuit 2. Euler Trail

3. abebcedcada 3. ebabdacedc