Republic of the Philippines

Surigao del Sur State University

Rosario, Tandag City, Surigao del Sur 8300
Telefax No. 086-214-4221
Website: www.sdssu.edu.ph

MODULE 5
The Mathematics of Graphs
Lesson 1 & 2
(Introduction of Graph Theory, Euler Circuits and Euler Paths)

Introduction

The graph theory was born out of a recreational puzzle, widely believed to have no connection
to mathematics at all. In the early eighteen century, the Pregel River in a city called Konigsberg
(located in modern-day Russia and now called Kalinigrad) surrounded an island before splitting
in two. Seven bridges crossed the river and connected four different land areas, similar to the
map drawn below. The question then was to determine if it was possible to visit the four land
areas without crossing any bridge twice.

In this lesson you will learn to solve and analyze problems such as how to find the least
expensive route and many more.

Specific Learning At the end of this lesson, you are expected to:
Outcomes:
1. Define conceptually the basic properties of mathematical graphs.
2. Determine whether or not the graph has an Euler path and/or an Euler
circuit;
 3. Solve real life problems using the concept of Euler’s path and Euler
circuit.

TEACHING LEARNING ACTIVITIES

Introduction to Graphs:
Graph
A graph is a set of points, called nodes or vertices, which are interconnected by a set
of lines called edges. The study of graphs, or graph theory is an important part of a number of
disciplines in the fields of mathematics, engineering and computer science.
Definition − A graph (denoted as G = (V, E)) consists of a non-empty set of vertices or nodes
V and a set of edges E. A vertex a represents an endpoint of an edge. An edge joins two
vertices a, b and is represented by set of vertices it connects.

Example − Let us consider, a Graph is G = (V, E) where V = {a, b, c, d} and E = {{a, b},
{a, c}, {b, c}, {c, d}}
Here V is verteces and a, b, c, d are various vertex of the graph.
Here E represents edges and {a, b}, {a, c}, {b, c}, {c, d} are various edge of the graph.

Degree of a Vertex − The degree of a vertex V of a graph G (denoted by deg (V)) is

the number of edges incident with the vertex V.

Vertex Degree Even / Odd

a 2 even

b 2 even

c 3 odd

d 1 odd

Even and Odd Vertex − If the degree of a vertex is even, the vertex is called an even
vertex and if the degree of a vertex is odd, the vertex is called an odd vertex.
Degree of a Graph − The degree of a graph is the largest vertex degree of that graph.
For the above graph the degree of the graph is 3.

In general, graphs can contain vertices that are not connected to any edges, two or more edges
that connect the same vertices (called multiple edges), or edges that loop back to the same
vertex. We will usually deal with connected graphs.

Figure 4

Activity 1. I’m the map!

Using the map of Surigao City (Figure 1)
1. Sketch at least three paths connecting six different schools in Surigao City.
(Surigao State College of Tehnology, Saint Paul University Surigao, North Eastern Mindanao
Colleges, Surigao Education Center, Saint Jude Thaddeus Institute of Technology, and
Surigao Doctors College)

Figure 1. Map of Surigao City

Activity 2:
Illustration: Form the illustration that you made in activity 1. Determine the degree of each
vertex.

deg (SEC) =
deg (NEMCO) =
deg (SSCT) =
deg (SPUS) =
deg (SDC) =
deg (SJTIT) =

Activity 2:
Directions: The following table lists of facebook friends. An “X” in the table below indicates
that the two are talking(chatting) to each other via messenger last night. Draw a graph that
represents this information, in which each person is represented by a point (called the vertex)
and a line (edge) connects two people if there is an “X”. And determine the degree of each vertex.
Robert Ezekiel Arthuro Steven Frances

Robert X X

Ezekiel X X X

Arthuro X X

Steven X

Frances X

Euler Path and Circuit

An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a
circuit that uses every edge of a graph exactly once.
 An Euler path starts and ends at different vertices.

 An Euler circuit starts and ends at the same vertex.

Example of Euler Path

 Example of Euler Circuit

Criterion for Euler Path

If a graph G has an Euler path, then it must have exactly two odd vertices. Or, to put it
another way, If the number of odd vertices in G is anything other than 2, then G cannot
have an Euler path.

Criterion for Euler Circuit

If a graph G has an Euler circuit, then all of its vertices must be even vertices. Or, to put
it another way, If the number of odd vertices in G is anything other than 0, then G
cannot have an Euler circuit.

Theorem: ( Euler 1736)

A connected graph 𝐺 is Eulerian if and only if the degree of each vertex of 𝐺 is even.

Remark: A connected graph with exactly two odd vertices has at least one Euler
path but no Euler circuit. Each Euler path must begin at one of the two odd
vertices, and it will end at the other odd vertex.

. SEC
Activity 3: Find as many circuits SDC

possible connecting all the schools as

shown in the figure 6

NEMCO SJTIT

Figure 6

SSCT SPUS
Activity 4: Identify if the given problem has an Euler Circuit
Illustration:
Let us help Mr. Man in delivering the packages to the addresses on eleven different streets, Refer
to Figure 8 shown below, the simplified version of the map drawn by Mr. Man with vertices as
the road intersections and lines as the roads. In order for him to make the best use of his time, he
needs to walk each edge just once.

Figure 8

Activity 5. Trail.
Your team are bicyclists; you guys wants to mountain bike through all the trails of a national
park. The map is given to you (see photo below). Well, you don’t have preference where to
begin and end the ride. However, you are challenged to traverse every trail as shown in the map
exactly once. Discuss with your team how are you going to do the ride that is where to begin
and end. Go!

If you find one, can you

find another alternative
route distinct from the
first one that will also
traverse the entire trail
exactly once?
SYNTHESIS (Adapted from Van der Vieran, Dan)

Watch the video clip and complete the statements that follow.
 How the Konigsberg Bridge Problem Changed Mathematics
https://www.youtube.com/watch?v=nZwSo4vfw6c

1. Three things that I significantly learned from the video clip:

2. Three things that are still unclear to me:

3. I used to think that….

4. Three questions that I want to ask about the video clip:

ASSESSMENT Quiz

From the given graph identify the degree of every vertex.

Vertex Degree
1. a
2. b
3. c
4. d
5. e
6. f
7. g

8. Which graph below contains an Euler circuit?

A. B.
 C. D.

9. Which of the following statements below describes an Euler path?

A. A connected graph that has two vertices of odd degree with all other
of even degree.
B. A connected graph with all vertices of even degree.
C. A connected graph with all vertices of odd degree.
D. It cannot be determined no unless you look at the graph.

10. Refer to the graph provided. Is there an Euler circuit in the graph? Is
there an Euler path? Justify your answer.

Assignment Directions: Fill in the box, then identify if the given graph is an Euler
circuit, Euler path or neither.
1.
 2.

RESOURCES:
Aufmann, R., et al., (2018), Mathematics in the Modern World. Phils.
Ed., Rex Books Store, Inc. Manila, Phils
Earnhart, R.T & Adina, E.M. (2018). Mathematics in the Modern
World.C&E Publishing, Inc. Quezon City, Phils
Harary, Frank (1969). Graph Theory. Addison – Wesley Publishing
Company, Inc.
http://www.geom.uiuc.edu/~doty/activities.html
https://jlmartin.ku.edu/courses/math105-F11/Lectures/chapter5-part2.pdf
https://www.tutorialspoint.com/edges-and-vertices-of-
graph#:~:text=Graph%20Theory,-
Definition%20%E2%88%92%20A%20graph&text=Here%20V%20is%2
0verteces%20and,various%20edge%20of%20the%20graph.&text=For%2
0example%2C%20in%20above%20case,and%20total%20edges%20are%
204.
Nocon, RC, Nocon, EG. (2018). Essestial Mathematics for the Modern
World. First Ed. C&E Publishing, Inc. Quezon City, Phils.
Van der Vieren, Dan. “How the Konigsberg Bridge Problem Changed
Mathematics.” Youtube, uploaded by TED-Ed, 1 September 2016,
https://www. Youtube.com/watch?v=nZwSo4vfw6c