MATHMW – Mathematics in the Modern World

First Semester A.Y. 2021-2022

MODULE 10 – MATHEMATICS AS A TOOL:
MATHEMATICS OF GRAPH
I. Topics
• Euler Graph
- Euler Path
- Euler Circuit
II. Learning Objectives
At the end of this module, the students will be able to:

• Demonstrate how to do Euler Circuits;

• Demonstrate how to do weighted graphs and its difference with Euler Circuits; and
• Use the Euler Formula to complete a Euler Circuit.
III. Content
10.1 Euler Graph
The Königsberg Bridge Problem
In the early eighteenth century, the mediaeval town of Königsberg in Prussia had
a central island (the Kneiphof) around which the Pregel river flowed before dividing in two.
The four parts of the town were linked by seven bridges as shown on the diagram.

Is it possible to find a route through Königsberg, beginning and ending at the same
point, that crosses each bridge exactly once?
 In 1731, Leonhard Euler published a paper that solved the problem and, at the
same time, gave birth to the subject of graph theory. Euler first represented the essential
features of Königsberg by a graph – the parts of the city are represented by vertices and
the bridges are represented by edges.
Think of all the various connections we experience in our lives—friends are
connected on Facebook, cities are connected by roads, computers are connected across
the Internet. A branch of mathematics called graph theory illustrates and analyzes
connections such as these.
For example, the diagram could represent friends that are connected on Facebook.
Each dot represents a person, and a line segment connecting two dots means that those
two people are friends on Facebook. This type of diagram is called a graph.

Graph
A graph can be defined by a set of points called vertices connected by line
segments or curves called edges. A graph is a connected graph when edges can be
drawn between every pair of vertices and there are no unreachable vertices. Two graphs
are equivalent graphs provided that the same vertices are adjacent. The number of edges
that meet at the vertex determines the degree of the vertex.
Example 10.1. The following table lists five students at a college. An “X” indicates that
the two students participate in the same study group this semester.

Solution: Drawing the graph that would illustrate the students’ study group.
Some types of Graphs
• This Graph has five vertices but no edges and is
referred to as a null graph. It is also an example of a
disconnected graph.

• This is a connected graph that has a pair of multiple

edges. Note that two edges cross in the center, but
there is no vertex there. Unless a dot is drawn, the
edges are considered to pass over each other without
touching.

• This graph is not connected; it consists of two different

sections. It also contains a loop.

• This is a connected graph in which every possible

edge is drawn between vertices (without any
multiple edges). Such a graph is called a
complete graph.

Equivalent Graphs
Two graphs are equivalent graphs provided that the same vertices are adjacent.
The number of edges that meet at the vertex determines the degree of the vertex.
Example 10.2.a. Determine whether the following two graphs are equivalent.

Solution: The graphs are equivalent since same vertices are adjacent.
Example 10.2.b. Determine whether the following two graphs are equivalent.

Solution: The graphs are not equivalent since some same vertices are not adjacent.
10.2 Euler Circuits
An Euler circuit is a path that uses every edge once and only once, and begins
and ends at the same vertex.
Eulerian Graph Theorem
A connected graph is Eulerian (contains Euler circuit) if and only if every vertex of
the graph is of even degree.
Example 10.3. Which of the following graphs has an Euler circuit?

Solution 10.3.a: The graph has no Euler circuit since vertices C and D are of odd
degrees.
Solution 10.3.b: The graph has an Euler circuit since every vertex of the graph is of
even degrees.
10.3 Euler Paths
An Euler path is a path that uses every edge once and only once.
Euler Path Theorem
A connected graph contains an Euler path if and only if the graph has two vertices
of odd degree with all other vertices of even degree. Furthermore, every Euler path must
start at one of the vertices of odd degree and end at the other.
Example 10.4. A bicyclist wants to mountain bike through all the 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 a preference for where she
begins and ends her ride. Is it possible for the cyclist to traverse all of the trails without
repeating any portions of her trip?
 Solution: The trail of the park satisfies the Euler Path Theorem. Thus, it is possible for
the cyclist to traverse all of the trails without repeating any portions of her trip.
IV. Self-Test

1. What are the key points in the module?

______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

2. Based on your readings, how can you apply the content from this module to your daily
life?
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

3. What insights did the module provide in your course?

______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
4. How has class discussion influenced your thinking on this module?
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

5. How can the learnings in this module improve your role in your school, family, and
community?
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________
______________________________________________________________________

References

• Aufmann, R. et. al., 2013, Mathematical Excursions, Third Edition, Cengage

Learning
• De Guzman, L. et. al. 2019, Worktext Mathematics in the Modern World, St.
Andrew Publishing House
V. Post-Test
1. The table below lists six telecommunication provider and indicates whether they
have agreements to roam onto each other’s networks. Draw a graph that
represents this information, where each vertex represents a company and an edge
connects two vertices if the corresponding providers have a roaming agreement.
Then use the graph to answer the questions: Which provider/s has/have roaming
agreements with the most carriers? Which provider/s can roam with only one other
network?

Provider Smart Globe Sun Cell PLDT TNT TM

Smart - No Yes Yes Yes No
Globe No - No Yes No Yes
Sun Cell Yes No - No Yes No
PLDT Yes Yes No - No No
TNT Yes No Yes No - No
TM No Yes No No No -

2. Determine whether the following are equivalent graphs.

a.

b.
3. In Exercises a to d, (i) find an Euler path if possible, and (ii) find an Euler circuit if
possible.
a. b.

4. Bob has just finished his brand-new house. The floor plan is shown below:

a. Bob wants to give Wendy a tour of his new house. Is it possible for them to
pass through every doorway exactly once? If possible, in which rooms must
they start and finish the tour? Explain.
b. Is it possible for them to tour the house visiting each room exactly once (not
necessarily using every doorway)? Explain.