Assignment 3.

NAME: DARIOUS M. PADAONG

YEAR/COURSE/SECTION: 2BPED B

For each graph below:

Graph 4
Graph 3
1. Write the degree of each vertex.
the degree of A is 4
the degree of A is 4
the degree of b is 4
2. Determine if the graph contains an Euler trail, an Euler circuit, or neither.
the degree of b is 4
the degree of c is 3
3.theIfdegree
an Euler
ofpath
c is 2or Euler circuit exists, give it down (e.g., acbdae)
the degree of d is 4
the degree of d is 4
the degree of e is 3
the degree of e is 4

Graph 4 Euler trail

Graph 3 Euler
circuit

Graph 1
Graph 2
the degree of A is 4
the degree of A is 2
the degree of b is 4
the degree of d is 4
the degree of g is 4
the degree of b is 2
the degree of h is 4
the degree of e is 4
the degree of d is 4
the degree of c is 2
the degree of i is 2

the degree of c is 4
Graph 2 Euler
the degree of f is 2 circuit

the degree of e is 2
Graph 1 Euler circuit