Module 6:

Graph
Theory
MS. LOQUE
 At the end of the module, you must be able to:

Intended ✓Familiarize with the different terms in graph theory.

Learning ✓Identify the different types of graphs.

✓Explain the differences between a walk, a trail, a path,

Outcomes a circuit, or a cycle.

✓Construct the types of graphs.

✓Define trees, bridges, and forests.

What is Graph Theory?
❖Graph Theory is branch of mathematics that deals with directed and
undirected graph.

❖A graph G consists of a set 𝑉 of vertices and a collection 𝐸 of unordered pairs of vertices

called edges, denoted by 𝐺 = (𝑉, 𝐸).
 Elements of Graph
The order of a graph is the number of its vertices, and its size is the number of its edges.

Two or more edges that join the same pair of distinct vertices are called parallel edges.

An edge represented by an unordered pair in which the two elements are not distinct is known as a loop.
Example of Graph
Consider the graph, determine the ff:
𝑉 𝐺 =
𝐸 𝐺 =

Order: 𝐺 =

Size: 𝐺 =

Parallel edges:

Loop:
 Types of Graph
1. Multigraph

2. Pseudograph

3. Simple Graph

4. Complete graph

5. Digraph
What is Multigraph?
Multigraph is a graph with no loops.
What is pseudograph?
Pseudograph is a graph with at least one loop.
What is a simple graph?
Simple graph is a graph with no parallel edges and no loops.
What is a complete
graph?
The complete graph 𝑲𝒏 is a graph with 𝑛
vertices in which there is exactly one edge
joining every pair of vertices.

The graph 𝐾1 with one vertex and no edge is

known as the trivial graph.
What is a digraph?
A directed graph or digraph consists of a finite
set V of vertices and a set A of ordered pairs of
distinct vertices called arcs.

𝑎𝑟𝑐𝑠 𝐷𝐺 =
Adjacent and Incident
If 𝑒 = {𝑢, 𝑣} ∈ 𝐸(𝐺), vertices 𝑢 and 𝑣 are said to
be adjacent(to each other) and incident to 𝑒.

Consider the graph:

2 and 3 are adjacent and incident to 𝑒1

2 and 3 are adjacent and incident to 𝑒2

3 and 4 are adjacent and incident to 𝑒4

4 and 5 are adjacent and incident to 𝑒6

6 and 7 are adjacent and incident to 𝑒10

Underlying Graph
If each arc of a digraph is replaced by an edge, the resulting graph is called the underlying graph of
the digraph.
Tournament
Any orientation of a complete graph is known as tournament.
Degree of a vertex
The degree of a vertex in an undirected graph is the
number of edges incident with it, except that the loop at a
vertex contributes twice to the degree of that vertex,
denoted by deg(𝑣).

deg 𝑎 =
deg 𝑏 =
deg 𝑐 =
deg 𝑑 =
deg 𝑒 =
deg(𝑓) =
deg 𝑔 =
In-degree & out-degree of vertex 𝑣
In a graph with directed edges (arcs):

➢the in-degree of vertex 𝑣, denoted by 𝑑𝑒𝑔− (𝑣), is the number of edges with 𝑣 as their terminal
vertex

➢The out-degree of vertex 𝑣, denoted by 𝑑𝑒𝑔+ (𝑣), is the number of edges with 𝑣 as their initial
vertex.
Example:
Consider the graph and determine the
following.

𝑑𝑒𝑔− 𝑎 = 𝑑𝑒𝑔+ 𝑎 =

𝑑𝑒𝑔− 𝑏 = 𝑑𝑒𝑔+ 𝑏 =

𝑑𝑒𝑔− 𝑐 = 𝑑𝑒𝑔+ 𝑐 =

𝑑𝑒𝑔− 𝑑 = 𝑑𝑒𝑔+ 𝑑 =

𝑑𝑒𝑔− 𝑒 = 𝑑𝑒𝑔+ 𝑒 =
Pendant and Isolated Vertex
A pendant vertex is a vertex whose degree is 1.

An isolated vertex is a vertex whose degree is 0.

Pendant vertex:

Isolated Vertex:
 Theorem
The graph 𝐺 = (𝑉, 𝐸), where 𝑉 = {𝑣1 , 𝑣2 , 𝑣3 , … , 𝑣𝑛 } and
𝐸 = {𝑒1 , 𝑒2 , 𝑒3 , … , 𝑒𝑛 }, satisfies σ𝑛𝑖=1 𝑑 𝑣𝑖 = 2𝑚

*𝑚 is the number of edges

Example:
How many edges are there in a graph with 10
vertices each of degree 6?

Solution:
6 10 = 2𝑚 This is known as the Handshaking Theorem: the sum
60 = 2𝑚 of the degrees of all vertices is twice the number of
𝑚 = 30 edges.
Example:
3
6
7
1 2 4

5 8

Sum of the degrees = 2 x No. of edges

3+4+4+4+1= 2 8
16 = 16
Theorem
Theorem 2: Let 𝐺 be a simple graph with at least 2 vertices. Then 𝐺 has at least 2 vertices of the
same degree.

Vertices 𝑎 and 𝑏; 𝑑 and 𝑒 Vertices f, h, j and 𝑘

of 𝐺1 have the same degrees. of 𝐺2 have the same degrees.
Corollary
Corollary 1.1: The sum of the degrees of the vertices of a graph is an even number.

Sum of the degrees

=3+4+4+4+1
= 16

Corollary 1.2: In a graph 𝐺, the number of odd degree is even.

deg 𝑎 = 3 deg 𝑏 = deg 𝑐 = deg 𝑑 = 4 deg 𝑒 = 1

Regular Graph
A graph in which each vertex has the same degree.

Julius Peter Christian

Petersen (1839-1910)
Danish mathematician
Subgraph
A graph whose vertices belongs to V(G) and each edges belongs to E(G).
𝐺 = (𝑉, 𝐸) is a graph

𝐺 ′ = (𝑉 ′ , 𝐸 ′ ) with 𝑉 ′ ⊆ 𝑉 and 𝐸 ′ ⊆ 𝐸.

𝑆 is a subgraph of
𝐺.
Bipartite Graph
If the vertex set of graph G can be split into two disjoint sets A and B so that
each edge of G joins a vertex of A and a vertex of B.

The group of vertices are not adjacent to each other.

Complete Bipartite Graph
A bipartite graph in which each vertex in A is joined to each vertex in B by
just one edge.
Denoted as Kr,s with r for black vertices and s for white vertices.
 Walk
•A walk in 𝐺 is a finite sequence of edges of the form 𝑣0 → 𝑣1 → 𝑣2 → ⋯ → 𝑣𝑛 (or
𝑣0 , 𝑒1 , 𝑣1 , 𝑒2 , … , 𝑣𝑛 𝑒𝑛 ) in which any two consecutive edges are adjacent.

➢𝑣0 the initial vertex

➢𝑣𝑛 the terminal vertex

•The length of walk is the number of edges in a walk

➢Any 𝑢 − 𝑣 walk 𝑢 = 𝑣 (and 𝑛 > 1) is called closed walk.

➢Any 𝑢 − 𝑣 walk 𝑢 ≠ 𝑣 is called open walk.
 Example

𝑎 → 𝑏 → 𝑐 → 𝑑 → 𝑒 → 𝑓 is a walk of length 5 from vertex 𝑎 to vertex 𝑓

The initial vertex of a walk is 𝑎 and the terminal vertex is 𝑓.

𝑎 → 𝑏 → 𝑐 → 𝑑 → 𝑒 → 𝑓 is an open walk.

𝑎 → 𝑏 → 𝑐 → 𝑔 → 𝑎 is a closed walk.
Trail
A walk with no repeated edges (edges are distinct).

𝑏 → 𝑐 → 𝑑 → 𝑒 → 𝑓 → 𝑑 → ℎ is a trail since there is no repeated

edges.
Note:
A repeated vertex is permissible like in the case of vertex 𝑑.
Path
A walk with no repeated vertices except possibly the initial and terminal
vertex (two vertices are distinct).

a → g → b → c → d → h → f is a path since there is no

repeated vertices.
Circuit
A nontrivial closed trail from a vertex v to itself.

a → g → c → b → a is a circuit since there is no repeated edges.

Cycle
A circuit that does not contain any repetition except that the initial vertex
and the terminal vertex (closed path such that n  3).
➢ A cycle of length k is called a k-cycle

a → b → c → d → h → g→f→ a is a cycle or
7–cycle since it has a length of 7.
 Properties of Walk, Trail, Path, Circuit
and Cycle
Items Vertices Edges
Walks Repetition is allowed Repetition is allowed
Trails Repetition is allowed Repetition is not allowed
Paths Repetition is not allowed except Repetition is not allowed
possibly in the initial and terminal
vertex
Circuits Repetition is allowed Repetition is not allowed
Cycles Repetition is not allowed except in Repetition is not allowed
the initial and terminal vertex
Trees
A tree is a mathematical structure that is a special kind of graph which has the following properties:

(1) it is undirected;

(2) it is connected (each of the vertices is connected with a link to at least one other vertex); and

(3) acyclic (there is only one route from any vertex to any other vertex or has no cycle).
Bridge and Forest
•Each edge connecting each pair of vertices is a
bridge.

•A forest is a disjoint union of trees. In other

words, forest is a set of trees.

•Each component of a forest is tree, and any tree

is a connected forest.

•Denote T as tree and F as forest.

•The number of components of a graph G is

denoted

c(G)
Identify:
End of Introduction to Graph
Theory
Trees
Presentation!

Prepared by:
Ms. Jacquiline Loque Walk, Trail, Circuit, Path
and Cycle