KIMURA, Yumi R.

ChE – 1 / A13
2019102775

Module 6: Exercise 2.1

For each item, draw the corresponding graph and draw conclusions as required.

1. For each of the graphs given below, determine if the graph is

i. Eulerian only, then specify an Eulerian circuit;

ii. Hamiltonian only, then specify a Hamiltonian cycle; or

iii. Neither Eulerian nor Hamiltonian, then give a justification.

a. ) It is Hamiltonian only, it has a closed loop on a graph where every vertex is connected only

once. Loop is just an edge that joins a vertex to itself. As you can see the graph, it is a path that

travels from a point back to itself but goes through every vertex or node.

b. ) It is Eulerian only, it is a path which starts on same vertex and also ends on it. The graph is a

collection of vertices, nodes, and edges that are connected with all the vertices. If there is a path

that traverses on each edge exactly (once) where the path begins and ends and all the vertices

have an even degree, then the graph is considered as an Euler circuit.

2. The graph below shows the pathways in a certain entertainment park. The head of the
Janitorial and Sanitation Office is designing a plan for the cleaning of the pathways.

a. ) Is it possible to design a cleaning schedule such that all pathways will be cleaned, with the

cleaning group passing through a pathway only once?

-It is not possible because there are points that can not be passed through. An example is,

if you start at line F and you want to go to line I then you will not pass through the lines H, E,

and more.
Start: F
Monday: Start from F To E
From E To A
Tuesday: Start from A To B
From B To I
Wednesday: Start from I To L
From L To K
Thursday: Start from K To J
From J To C
Friday: Start from C To H
From H To D
b. ) Design a cleaning schedule, if possible,
Saturday: Start from D To A
From A To G
Sunday: Start from G To F
End: F
based on a such that starting from one point, the cleaning group would be able to clean all

pathways and get back to the starting point.

Start: A
Monday: Start from A To E
From E To F
Tuesday: Start from F To G
From G To A
Wednesday: Start from A To D
From D To H
Thursday: Start from H To C
From C To L
Friday: Start from L To K
From K To J
c. ) Design a Saturday: Start from J To D cleaning schedule, if
possible, based on a From D To A such that starting from

Sunday: Start from A To B

From B To I
End: I
one point, the cleaning group would be able to clean all pathways this time not necessarily to get
to the starting point.