NAME: Darious M.

Padaong 3BPED-B

For each of the graphs below,

1. Give the degree of each vertex.

2. Put a check if there is a (a) Hamiltonian path, (b) Euler trail, (c) Euler circuit, or
none of these.
3. If there is a Hamiltonian path, write it down (e.g., afcbde).
4 None of these

4 4

cabde
4 4

3
1
2 None of these

2 3
1
 None of these

1 3 3 1