MTH 610 GRAPH THEORY

Klariz Angelique D. Apolinario

Discussant

West Visayas State University College of Education-Graduate School

 Objectives Of The Day
 Define the following: path, connected path,
subgraph, component, simple path, cycle, and
simple cycle.
 Define Euler cycle.
 Identify different theorems related to paths and
cycles.

MTH 610 GRAPH THEORY

 Path corresponds to
a trip

edges
roads

vertices
cities, or
municipalities,
provinces
MTH 610 GRAPH THEORY
What is a Path? (𝟏, 𝒆𝟏 , 𝟐, 𝒆𝟐 , 𝟑, 𝒆𝟑 , 𝟒) or (1, 2, 3, 4)

a path of length 3 from vertex 1 𝒕𝒐 𝟒

Definition: Path (5) consisting of
only vertex 5 is a path of (5)
Let 𝑣0 𝑎𝑛𝑑 𝑣𝑛 be vertices on a
length zero from vertex 5
graph. to 5 5
A path from 𝑣0 𝑡𝑜 𝑣𝑛 of length n (1,2,3,4,5,6) G: 𝒆𝟓 𝒆𝟔
3 𝒆𝟑
is an alternating sequence of n+1
a path of 𝒆𝟐
vertices and n edges beginning length 5 from 4 6
with vertex 𝑣0 and ending with vertex 1 𝒕𝒐 𝟔
2 𝒆𝟒
vertex 𝑣𝑛 .
𝒆𝟏
(𝑣0, 𝑒1 , 𝑣1 , 𝑒2 , … , 𝑣𝑛−1 , 𝑒𝑛 , 𝑣𝑛 ),
(𝟏, 𝒆𝟏 , 𝟐, 𝒆𝟐 , 𝟑, 𝒆𝟑 , 𝟒, 𝒆𝟒 , 𝟐)
in which edge 𝑒𝑖 is incident on 1 or (1, 2, 3, 4, 2)
the vertices 𝑣𝑖−1 and 𝑣𝑖 for 𝑖=
1…,n. a path of length 4
from vertex 1 𝒕𝒐 𝟐
MTH 610 GRAPH THEORY
What is a Connected graph? 5
Examples:
𝒆𝟓 𝒆𝟔
3 𝒆𝟑
G: 𝒆𝟐 Definition:
4 6 G: 𝒆𝟒
𝒆𝟒
2 𝒆𝟑 A graph G is connected
𝒆𝟏
if any two vertices of the
1
𝒆𝟏 𝒆𝟐 graph are connected by
a path.

G: 𝒆𝟓 Disconnected
𝒆𝟑 graphs 𝒆𝟐G: 𝒆𝟑
𝒆𝟐 𝒆𝟓
𝒆𝟏
6 𝒆𝟏 𝒆𝟔
4 𝒆𝟒

MTH 610 GRAPH THEORY 7

 What is a subgraph?
Definition: G
Let G = (V,E) be a graph. (V’, E’)
is a subgraph of G if:
(a) V’ ⊆ V and E’ ⊆ 𝐸 Subgraphs of G
(b) ∀ 𝑒 ′ ∈ E’, if e’ is incident on
G’:
v’ and w’, then v’ and w’ ∈ V’. G’:

G’:
G’: 3 G’:
𝒆𝟐 3
4 𝒆𝟐
G’:
2
2
MTH 610 GRAPH THEORY
 What is a subgraph?
NOTE:
• When deleting a vertex from a graph, G:
you MUST also delete all edges
adjacent to that vertex.
• When deleting an edge from a graph,
you do NOT delete the endpoints of
that edge. Subgraphs of G

G’:
G’:
3
G’: 𝒆𝟐 G’:
4 G’:
2 3
G’: 𝒆𝟐

2
MTH 610 GRAPH THEORY
 Find all subgraphs of the graph G
having at least one vertex.
Subgraphs of G
G:

𝑮𝟐

Note: 𝑮𝟏
𝑮𝟑 𝑮𝟒
“Every graph is a
subgraph of
Thus, graph G has 4 subgraphs.
itself.”
MTH 610 GRAPH THEORY
 What is a component?
Definition:
G:
Let G be a graph and let v be a
vertex in G. The subgraph G’ of
G consisting of all edges and
G: vertices in G that are contained
5
𝒆𝟓 𝒆𝟔 in some path beginning at v is
3 𝒆𝟑
𝒆𝟐 called the component of G
4 6
𝒆𝟒
containing v.
2
𝒆𝟏

1 A graph is connected iff it has one component.

MTH 610 GRAPH THEORY

 What is a component?
Example Definition:
•The component of G containing 1 is the Let G be a graph
subgraph G: and let v be a
𝒆𝟑
𝑮𝟏 = 𝑽𝟏 , 𝑬𝟏 𝑽𝟏 = {1,2,3} 𝑬𝟏 = {𝒆𝟏 , 𝒆𝟐 , 𝒆𝟑 } vertex in G. The
subgraph G’ of G
•The component of G containing 6 is the 𝒆𝟏 𝒆𝟒 consisting of all
subgraph 𝒆𝟐 edges and
vertices in G that
𝑮𝟐 = 𝑽𝟐 , 𝑬𝟐 𝑽𝟐 = {6} 𝑬𝟐 = { } (empty set) are contained in
some path
•The component of G containing 4 is the beginning at v is
subgraph called the
𝑮𝟑 = 𝑽𝟑 , 𝑬𝟑 𝑽𝟑 = {4,5} 𝑬𝟑 = {𝒆𝟒 }
component of G
containing v.
MTH 610 GRAPH THEORY
Simple Path, Cycle, & Simple Cycle
Let 𝑣 and w be vertices in a graph 𝐺.
G:
A simple path A cycle is a path A simple cycle is
from v to w is a of nonzero length a cycle from v to
path from v to w from v to v with v in which,
with no repeated no repeated except for the
vertices. edges. beginning and
Simple Simple
ending vertices
Cycle
Path Cycle that are both
(1,2,3,4,5) equal to v, there
are no repeated
(1,3,5,4,3,2,1) vertices.
(1,2,3,1)
MTH 610 GRAPH THEORY (6)
Cycle: no repeated edges. (v to v)
Euler Cycle
A cycle in a graph G
that includes all of the
edges and all of the
vertices of G is called
an Euler cycle.
G:
No Euler cycle in the graph G.
MTH 610 GRAPH THEORY
Note: If a graph G has
an Euler cycle, then
every vertex in G has
even degree.
Examples (degree= number of
edges incident on v).
G:
G:
Cycle: no repeated edges. (v to v)

Theorem 8.2.17
Euler Cycle
G:
If a graph 𝐺 has an
Euler cycle, then 𝐺
G:
is connected and Note: If G consists
every vertex has of one vertex v and
even degree. no edges, we call
the path (v) an
Theorem 8.2.18 Euler cycle for G,
If 𝐺 is a connected this is for technical
graph and every reasons.
vertex has even
degree, then 𝐺 has
an Euler cycle.

The proof of the theorems is found on page 392-393 of

MTH 610 GRAPH THEORY Introduction to Discrete Mathematics by Johnsonbaugh.
 Euler Cycle
Verify that 𝑮 has an Euler cycle and find an
Euler cycle for 𝑮.

G:
𝛿 (A) = 𝛿 (E) = 𝛿 (C) = 4
𝛿 (B)= 𝛿 (F) = 𝛿 (D) = 2
Since the degree of every vertex is even, by
Theorem 8.2.18, 𝑮 has an Euler cycle.

Euler Cycle can be:

(𝑫, 𝒆𝟏 , 𝑨, 𝒆𝟐 , 𝑩, 𝒆𝟑 , 𝑪, 𝒆𝟒 , 𝑨, 𝒆𝟓 , 𝑬, 𝒆𝟔 , 𝑪, 𝒆𝟕 , 𝑭, 𝒆𝟖 , 𝑬, 𝒆𝟗 , 𝑫)

MTH 610 GRAPH THEORY Cycle: no repeated edges. (v to v)

 Theorem 8.2.21

Example: 𝛿 (A) = 𝛿 (E) = 𝛿 (C) = 4 𝛿 (B)= 𝛿 (F) = 𝛿 (D) = 2

𝑛

𝛿 (𝑣𝑖 ) = 4 + 4 + 4 + 2 + 2 + 2 = 18 = 2(9)
𝑖=1

Corollary 8.2.22

MTH 610 GRAPH THEORY The proof of the theorem is found on page 394.
Theorem 8.2.23

Example:
𝛿 (A) = 𝛿 (C) = 4
𝛿 (B) = 𝛿 (F) = 2
The path can be: 𝛿 (E) = 3
(𝑫, 𝒆𝟏 , 𝑨, 𝒆𝟐 , 𝑩, 𝒆𝟑 , 𝑪, 𝒆𝟒 , 𝑨, 𝒆𝟓 , 𝑬, 𝒆𝟔 , 𝑪, 𝒆𝟕 , 𝑭, 𝒆𝟖 , 𝑬) 𝛿 (D) =1

MTH 610 GRAPH THEORY

Theorem 8.2.24 G:

Cycle

(1,3,5,4,3,2,1)
Simple Cycle

(1,2,3,1)
(4,5,3,4)

MTH 610 GRAPH THEORY

Thank you for listening.
God bless everyone.
Reference:
Johnsonbaugh, R. (2005). Introduction to Discrete
MTH 610 GRAPH THEORY Mathematics (6th Edition). Prentice Hall