Zapanta, Arlyn Leane M.

BSBAMMOUM 1-A
MATH IN THE MODERN WORLD
Assessment 6
1. Let V = {cities of Metro Manila} and E = {(x; y) x and y are adjacent cities in Metro Manila}.
(a) Draw the graph G = (V; E). You may use initials to name a vertex representing a city.
(b) Apply the Four-Color Theorem to determine the chromatic number of the vertex coloring for G.
Caloocan- C Pasig- Pg
Navotas- N Taguig - T
Manila- Ml Muntinlupa - Mu
Makati - Mk Malabon - Mb
Pateros- Ps Marikina- Mk
Las Pinas- L Mandaluyong- My
Valenzuela- V Pasay- Py
Quezon City- QC Paranaque- Pe
San Juan- -S
Y = (C, Y, Mb, N, QC, MK, MI, S, My, Pg, Py, Ps, T, Pe, L, Mu)
Implies the number of vertices in G is 17.
→Set E of edges of G:
E= (CY, QC, CMb, CN, CMI, YMb, VQ, MGN, QMI, QS, QMk, QPy, Qumix, MUN, MIPY, Mimms, MIS, MLMy,
SMy, MKPg, MyPg, Mymt, PgMt, PgPs, Pgt, MtPy, MtPs, Mott, PyPe, PyT, PST, Tepa, PeL, PeHUB, Cmu)
Implies the number of Edges in G is 34.
a.) Graph G= (V; E)

The vertices of G are labeled by ‘dots’

and the edges of G joining a pair of
vertices are labeled by ‘lines’.
 b.) Let the colors blue, red, green, yellow and be 'abbreviated by B, R, G, and Y respectively. Clearly, the seventeen
vertices of G are colored by these four colors as shown in the graph G. By the four - color theorem, a planar graph
can be 4-colored and so the chromatic number of the vertex coloring of G is 4.

2. Apply Euler’s Theorems and Fleury’s Algorithm to determine Euler path and Euler circuits in each graph.
(a) (b)

Let letters = vertices

numbers = degree of each vertices

Degree of a vertex is the number of branches joining the vertex. Here, all
the vertices have even degree.

Fleury’s Algorithm→ used to find out Euler path. As per this algorithm,
ABGHBCJEHCDEFGA is a Euler path for this graph.

Letters = vertices

Numbers = degree of each vertices

3. A business man has to visit five cities A, B, C, D and E. The distance (in hundred miles) between the five cities is as
follows:

If the businessman starts from city A and has to come back to his starting point, which route should he
select so that the total distance travelled is minimum.

Choose the shortest distance between two cities.

Shortest cities from A to any cities = 4
A→E (4) Distance Route:
E→B (6)
B→D (5)
D→C (9)
C→A (6)
A→E→B→D→C→A
4+6+5+9+6 = 30

4. Apply Kruskal’s Algorithm to determine a minimum spanning tree in each graph.

(a) (b)
 Therefore, the minimum spanning tree is

=b–c+d–e+b–d+ a–b

The weight of the minimum spanning tree is

1 + 2 + 3 + 5 = 11

Therefore, the minimum spanning tree of the above graph is

= (d-e) + (c-d) + (e-f) + (a-b) +(b-e) + (g-h) + (i-j) + (c-g) + (e-i) + (g-k)

=1+2+2+3+3+3+3+4+4+5+6

= 36