Module Overview: GE 7 Mathematics in The Modern World Module 6: Mathematics of Graphs
Module Overview: GE 7 Mathematics in The Modern World Module 6: Mathematics of Graphs
0 10-July-2020
MODULE 6
MODULE OVERVIEW
This module consists definitions of the basic terminologies in Graph Theory. This includes the different parts
of graphs and types of graphs. Euler path and Euler circuit will also be discussed in this module. Different
illustrations are presented to visualize more the various concepts in Graph Theory.
LEARNING CONTENTS
LESSON 1 GRAPH
The graph G in Figure 1.1 consists of vertices together with the edges is a pair of sets where
and .
In Figure 1.2, we have three vertices namely vertex , vertex , and vertex . Therefore, the vertex set of graph is
.
The graph in Figure 1.3 has three edges namely and . The edge set of the graph is .
In Figure 1.6, two vertices and are adjacent because there is an edge connecting them and edge is
called the incident because it connects the two vertices and .
In Figure 1.7, two edges and are adjacent because they have a common vertex and vertex is called the
incident vertex.
In Figure 1.8, the pair of vertices and contain more than one edge namely edges and . Therefore, the graph in
Figure 1.8 has multiple edges.
The graph in Figure 1.9 has a loop found at the vertex namely edge .
In Figure 1.10, the degree of the vertices a, b, c, d, and e are 1, 3, 1, 2, and 1, respectively. The degree of each vertex is
represented by , since only edge is incident to it, because there are three edges incident
to it, since only edge is incident to it, because there are two edges and
incident to it and because only edge is incident to it.
In Figure 1.11, the vertex h is an isolated vertex because there is no edge connected to it. In other words, the degree of
vertex h is 0 or deg(h)=0.
In Figure 1.12, vertex u is an end vertex because it has one edge incident to it.
There are various types of graphs depending upon the number of vertices, number of edges, interconnectivity,
and their overall structure. We discuss some important types of graphs in this lesson.
As an example of null graph shown in Figure 1.14, there are three vertices namely vertex , vertex , and vertex and
there is no edge connected to them.
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
The graph in Figure 1.15 is an example of a trivial graph, it has only one vertex named vertex .
Note: Trivial graph is different from Null graph because trivial graph contain only one vertex while null graph contains two
or more vertices without edges incident to it.
In Figure 1.16, there are five vertices and and six edges and . Each edge bears an
arrow mark that shows its direction. Therefore, it is a directed graph.
Theorem 1.1
Let G be a directed graph with V vertices and E edges. Then,
In Figure 1.17, there are six vertices a, b, c, d ,e ,and f and eight edges , , , , , , and . Using theorem
1.2.1, we first show the indegree of the graph:
|E| =
= indeg(a) + indeg(b) + indeg(c) + indeg(d) + indeg(e) + indeg(f)
=1+1+2+2+1+1
=8
The second is the outdegree of the graph:
|E| =
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
The graph in Figure 1.18 has no loops or multiple edges. Thus it is a simple graph.
In Figure 1.19, all the vertices have the same degree. Hence, this graph is called regular graph. The degree of each
vertices is represented by , , , so it is called 2-regular graph.
The graph in Figure 1.20 named K4, is a complete graph because it has four vertices and each vertex is connected or
incident to other vertices.
V1 V2
In Figure 1.21, we have sets of vertices V1 and V2, every edge in the graph connects a vertex in set V1 and a vertex in set
V2. Vertices d and e are connected by edge . Vertices d and g are connected by edge . Vertices c and f are
connected by edge . Vertices c and g are connected by edge .
V1 V2
The graph of Figure 1.22 showing each vertex in is connected to all other vertices in .
Note: Bipartite graph and complete bipartite graph is different from one another because in bipartite graph, not all vertices
in set connects to the vertices in set while in complete bipartite graph all the vertices in set is incident to the
vertices in set set .
Your Turn 1
In the graph in Figure 2.1, the sequence is a walk between vertex and vertex .
In Figure 2.2, the walk is a closed walk because it started from vertex and back to
itself.
The graph in Figure 2.3 has walk. Therefore, the initial vertex is and the final vertex is .
In Figure 2.4, is a walk and its length is 4 because there are 4 edges from the initial vertex v and
final vertex w.
In Figure 2.6, the sequence is a trail since there is no edge that is repeated.
Note: A walk, trail, and path is closed if it starts and ends on the same vertex but it is open when it starts and ends on
different vertices. The walks in Figures 2.3 and 2.4 are open. The path in Figure 2.5 is open. The trail in Figure 2.6 is
open.
In Figure 2.8, we have three vertices, A, B, and C and also three edges, . Since every vertex has exactly
two edges incident to it. Therefore, it is a cycle and denoted as .
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
Your Turn 2
Let G be a graph
a. Identify whether the graph G has a trail, path, circuit and cycle.
b. What is the shortest length between vertex to vertex ?
Figure 2.13 has a circuit, it has a route where you can pass by each edge or line in the graph exactly once and
end up where you began. The Euler circuit is A, E, D, B, E, C, A.
Note: An Euler path is different from an Euler circuit because Euler path starts and ends on different vertices while Euler
circuit starts and ends on the same vertex.
Your Turn 3
LEARNING POINTS
A graph is a pair of sets comprising a set of vertices together with a set of edges. A vertex is a point
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
LEARNING ACTIVITY
1. Find the number of vertices, the number of edges, and the degree of each vertex in the given
b.
c.
2. Find the sum of the degrees of the vertices of each graph in Exercise 1 and verify that it equals twice
the number of edges in the graph.
3. Determine the number of vertices and edges and find the in-degree and out-degree of each vertex for
the given directed multigraph.
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
a.
b.
c.
4. Refer to Exercise 3. Determine the sum of the in-degrees of the vertices and the sum of the
outdegrees of the vertices directly. Show that they are both equal to the number of edges in the
graph.
6. Determine whether the given graph has an Euler circuit. Construct such a circuit when one exists. If
no Euler circuit exists, determine whether the graph has an Euler path and construct such a path if
one exists.
a.
b.
c.
d.
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020
f.
7. Determine whether the directed graph shown has an Euler circuit. Construct an Euler circuit if one
exists. If no Euler circuit exists, determine whether the directed graph has an Euler path. Construct an
Euler path if one exists.
a.
b.
c.
d.
e.
REFERENCES
Books:
Study Guide in Mathematics in the Modern World FM-AA -CIA-15 Rev. 0 10-July-2020