TINGSON, MELCHISEDEC D.

GED102-1 B8
SW3.1 MODULE 3

1. The Only Eulerian showed in the examples above is Graph 3, Meanwhile, Graph 2 and 1
is not, for the following reasons:
a. Graph 1 obtained the same degree for all its vertices
b. Graph 2 only visits the edges once allowing eulerian path.

2. Given that the graph comprises four odd-degree vertices, it is not possible to traverse
through every vertex once but also not twice. And the graph also portrays the 0%
possibility of being able to return to the starting point.
3. Which graph is Hamiltonian?
a. Graph 1 is Hamiltonian because a-b-d-f-e-c-a may be followed in a cycle.
b. Graph 2 is not Hamiltonian since there is no cycle that will pass through all of the
vertices below.
c. Since Graph 3's vertex boundaries are not all crossed by a traceable cycle, it is not
Hamiltonian.