Scribd
Upload
26 views3 pages

Problem Set - MMW - BSBAHRM 3-2N

Uploaded by

Poli Abrenica
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views3 pages

Problem Set - MMW - BSBAHRM 3-2N

Uploaded by

Poli Abrenica
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MATHEMATICS IN THE MODERN WORLD

Lesson 6: Graph Theory

Group 4

 Abrenica, Polivien Junel T.


 Arciaga, Rodge Christian E.
 Dela Cruz, Myla A.
 Delos Reyes, Kristian D.
 Del Rosario, Sophia Ashley F.

I. Let
V = {−2 ,−1 , 0 ,1 , 2 }

|
E 1= { ( x , y ) }
x+ y
2 }
ϵZ ,

E = { ( x , y ) }| ϵ Z }
xy
2
2
A. Graph the following:
1. G1=(V , E 1)
2. G2=( V , E2 )

B. Graph the number of edges of the following:


1. G1=(V , E 1)
2. G2=(V , E 2)

C. Complete the table. Determine the degree of each vertices.

Vertex G1 G2
-2
-1
0
1
2
II. Let

A. One of the graphs above has no Euler path. Determine which one is it. State the
reason why it has no Euler path.

B. For each graph with an Euler path, determine one Euler path.

C. Determine which of the graphs above has an Euler circuit. For the graph with an
Euler circuit, using Fleury’s algorithm, determine the Euler circuit.

III.
The table below shows the distances of towns A, B, C, D, E, and F from each
other, in km.
Town A Town B Town C Town D Town E Town F
Town A * 38 30 15 35 11
Town B 38 * 14 21 19 16
Town C 30 14 * 40 23 27
Town D 15 21 40 * 12 17
Town E 35 19 23 12 * 41
Town f 11 16 27 17 41 *

A. Let the town be the vertices of a graph, and the distances in km be the weight of the
edge connecting the vertices. Create a complete weighted graph of the table from the
previous slide.

B. Consider a salesman who must make exactly one stop in each town before heading
back to his starting place (Hamilton circuit). Using the nearest neighbor method,
determine the shortest route available across the towns.

C. Consider a salesman who must make exactly one stop in each town before heading
back to his starting place (Hamilton circuit). Using the cheapest link algorithm,
determine the shortest route available across the towns.
IV.
Consider the complete weighted graph from item III. Using Kruskal’s algorithm,
determine the minimum spanning tree. Draw the minimum spanning tree.

V.
Consider the map of Laguna below.

Let the following vertices be assign to each municipalities in Laguna:

1: Kalayaan 6: Pila 11: Victoria


2: Lumban 7: Magdalena 12: Calauan
3: Santa Cruz 8: Luisiana 13. Nagcarlan
4. Pagsanjan 9: Majayjay 14. Rizal
5: Cavinti 10: Liliw 15. San Pablo

Apply the Four-Color Theorem to determine the chromatic number of the vertex
coloring for the graph of the Laguna map.

You might also like