Math Activities
Math Activities
Submitted by:
Gelasque, Shane Ann
Lumayno, Meah
Paran, Jeliane Santanina
Ramiso, Lorenze Michael
Submitted to:
Dr. Juanito G. Galos
November 2024
Introduction
The table below shows the nonstop flights offered by a small airlines Draw a graph that
represents this information. Where each vertex represents a city and an edge connects
two vertices if there is a nonstop flight between the corresponding cities.
Newport
Lancaster
Dorset
Plymouth
Auburn
Activity 2
Social Network Graph Analysis
A group of friends is represented by the graph at the right. An edge connecting two
names means that the two friends have spoken to each other in the last week.
Nicole
Michel
Linzie
Raquel
Claire
Junits
a. Have Michel and Clair Talked each other in the last week?
No, they haven’t.
b. How many of the friends in this group has Junits talked to in the last week?
(Identify the names)
Junits talked to 4 of his friends last week, namely Claire, Raquel, Michel,
and Nicole.
c. Among this group of friends, who has talked on the most people in the last week.
(Identify the names he/she has talked to)
Junits has talked to most of the people in the group. He talked to Claire,
Raquel, Michel, and Nicole.
d. Why would it not make sense for the graph to contain a loop?
The graph shows a group of friends’ communication last week, a loop
wouldn’t make sense because it would mean a person has talked to
themselves.
Activity 3
Euler Circuit
A bicyclist wants to mountain bike through all trails of a national park. A map of the park
is shown below. Because the bicyclist will be dropped off in the morning by friends and
picked up in the evening, she does not have preference for where she begins and ends
her ride. Is it possible for the cyclist to traverse all the trails without repeating any
portions of her trip (Provide the rout).
A B
F
G
Yes, it is possible for the cyclist to traverse all the trails without repeating any portions of
her trip, using A → B → C → D → E → B → G → F → E → C → A → F as her path.
Activity 4
Hamiltonian Circuit
The table below lists cities serviced by a small airlines. An “X” in the table indicates a
direct flight offered by the airline. Draw a graph that represents the direct flights, and
use your graph to find a route that visits each city exactly once and returns to the
starting city. (Provide the rout).
Bohol
Cagayan
Cebu Davao
Gen Boracay
Santos
Manila
Activity 5
Weighted Graph
Junits needs to visit the pet store, the shopping mall, the local farmers market, and
pharmacy. His estimated driving times (in minutes) between the locations are given in
the table below. Use the greedy algorithm and the edge-picking algorithm to find two
possible routes, starting and ending at home, that will help Junits minimize his total
travel time.
Greedy Algorithm:
Pet Store
18 24
Home Shopping
27 Mall
15 32
8 20
22
10
Pharmacy Farmers
22
Market
Pet Store
18 24
Home Shopping
27 Mall
15 32
8 20
22
10
Pharmacy Farmers
22
Market
Sketch a planar graph (without multiple edges or loop) in which every vertex has
A. degree 3
B. degree 4
Insights
Graphs go beyond the basic components of vertices and edges to study complex
concepts like loops, Euler pathways, and Hamiltonian circuits, which explore different
ways to cycle or traverse a graph. While weighted graphs provide edges values that
typically show costs and distances, which improves problem-solving skills. Planar
graphs highlight the value of simplicity and structure because they may be drawn
without any edges crossing. Problems like finding the minimal spanning or effective
network connections can be solved in algorithms like edge-picking and the greedy.
These ideas enhance our understanding of how complicated systems are represented
and made simpler by graphs.