Math Assignment Friday
Math Assignment Friday
COA1I-B 04-10-2024
ASSESSMENT:
1. Determine whether the graph is Eulerian. If it is, find an Euler circuit. If it is not, explain why. If the
graph does not have an Euler circuit, does it have an Euler walk? If so, find one. If not,
explain why?
a. b. c.
Eurelian Graph
This graph does not meet the Vertices D and C in this graph, as we
Eurelian Circuit;
criteria to be considered as an can see, have odd degrees, which goes
A-D-E-C-D-B-E against the criteria for an Eulerian
Eulerian graph; it cannot have an
Euler circuit since some of its graph. Thus, it can't have an Eulerian
vertices have odd degrees. circuit although it has met the criteria
Moreover, this is not an Euler walk for an Euler walk.
because some of its edges were D-A-E-B-F-C
used more than once. It departs at
A, travels to C, circles back to E,
then travels back to C, then back to
A, only to reach D and end by E.
It's clear that two edges were used
twice.
2. Use trial and error to find two Hamiltonian circuits of different total weights, starting at vertex A inthe
weighted graph. Compute the total weight of each circuit.
a. b.
(A-C)+(C-B)+(B-E)+(E-D)+(D-A) 8+7+4+10+9+3= 41
8+1+9+7+7=32
4. APPLICATION:
a. Draw a graph that corresponds to the information.
deg(Makati city)= 3
5. The subway map shows the tracks the subway trains traverse as well as the junctions where one can
switch trains. Identify two (2) Eulerian Walk.