Vietnam National University of HCMC

International University
School of Computer Science and Engineering

Session 9
Graph Theory
Dr. Nguyen Van Sinh
[email protected]
Part 1: Graphs and Graph Models:
Basics, Concepts and Terminologies

1. Types of Graphs
2. Basic Terminology
3. Some Special Simple Graphs
4. New Graphs from Old Graphs

2
1. Type of Graphs
Simple Graph
Definition 1. A simple graph G = (V, E) consists of V, a
nonempty set of vertices, and E, a set of unordered pairs of
distinct elements of V called edges.

Detroit
New York
San Francisco

Chicago
Denver Washington

Los Angeles
What are the vertices and edges? 3
 Detroit
New York
San Francisco

Chicago
Denver Washington

Los Angeles

What are the vertices?

SET OF VERTICES

V = {San Francisco, Los Angeles, Denver,

Chicago, Detroit, New York, Washington}
4
 Detroit
New York
San Francisco

Chicago
Denver Washington

Los Angeles
What are the edges?

SET OF EDGES

E = { {S F, L A}, {S F, Denver}, {L A, Denver},

{Denver, Chicago}, {Chicago, Detroit}, {Detroit, N Y},
{N Y, Washington}, {Chicago, Washington},
{Chicago, N Y} }
5
 Detroit
New York
San Francisco
Chicago
Denver Washington
Los Angeles

The network is made up of computers and telephone lines

between computers.
There is at most 1 telephone line between 2 computers in the
network. Each line operates in both directions.
No computer has a telephone line to itself.
These are undirected edges,
each of which connects two distinct vertices, and
no two edges connect the same pair of vertices.

6
 Multigraph, A Non-Simple Graph

There can be multiple telephone lines between two

computers in the network.
Detroit
New York
San Francisco

Chicago
Denver Washington

Los Angeles

nIna multigraph G = (V, E) two or more edges may

connect the same pair of vertices.
7
 Multiple Edges

Detroit
New York
San Francisco

Chicago
Denver Washington

Los Angeles

Two edges are called multiple or parallel edges

if they connect the same two distinct vertices.

8
 Pseudograph, A Non-Simple Graph
There can be telephone lines in the network from a computer
to itself (for diagnostic use). Detroit
New York
San Francisco

Chicago
Denver
Washington
Los Angeles
n In a pseudograph G = (V, E) two or more edges may connect
the same pair of vertices,
n and in addition, an edge may connect a vertex to itself.
9
 Loops

Detroit
New York
San Francisco

Chicago
Denver
Washington
Los Angeles

An edge is called a loop

if it connects a vertex to itself.
10
 Undirected Graphs

pseudographs
multigraphs
simple graphs

11
 A Directed Graph
l In a directed graph G = (V, E ) the edges are
ordered pairs of (not necessarily distinct)
vertices.
Detroit
New York
Chicago
San Francisco

Denver Washington

Los Angeles
Some telephone lines in the network may operate in only
one direction .
12
 A Directed Graph
The telephone lines in the network that operate in two
directions are represented by pairs of edges in opposite
directions.

Detroit
New York
Chicago
San Francisco

Denver Washington

Los Angeles
13
 A Directed Multigraph
In a directed multigraph G = (V, E ) the edges are ordered
pairs of (not necessarily distinct) vertices, and in addition
there may be multiple edges.
Detroit
New York
Chicago
San Francisco

Denver Washington

Los Angeles

There may be several one-way lines in the same direction from

one computer to another in the network.
14
 Types of Graphs
Graph Terminology
Type Edges Multiple Edges? Loops Allowed?
Simple Undirected No No
graph
Multigraph Undirected Yes No
Pseudograph Undirected Yes Yes
Simple Directed No No
directed
graph
Driected Directed Yes Yes
multigraph
Mixed graph Directed and undirected Yes Yes

15
2. Basic Terminology Adjacent Vertices

Definition 1. Two vertices, u and v in an

undirected graph G are called adjacent (or
neighbors) in G, if {u, v} is an edge of G.
An edge e connecting u and v is called
incident with vertices u and v, or is said
to connect u and v.
The vertices u and v are called endpoints of
the edge {u, v}.

16
 Degree of a vertex

Definition 1. The degree of a vertex in an

undirected graph is the number of edges
incident with it, except that a loop at a vertex
contributes twice to the degree of that
vertex.

c d
b deg( d ) = 1

deg( e ) = 0
a g f e
17
 Degree of a vertex
Definition 1. The degree of a vertex in an
undirected graph is the number of edges
incident with it, except that a loop at a vertex
contributes twice to the degree of that vertex.

c d
deg( b ) = 6 b

a g f e

18
Degree of a vertex

Find the degree of all the other vertices.

deg( a ) deg( c ) deg( f ) deg( g )

c d
deg( b ) = 6 deg( d ) = 1
b

deg( e ) = 0
a g f e

19
Degree of a vertex

Find the degree of all the other vertices.

deg( a ) = 2 deg( c ) = 4
deg( f ) = 3 deg( g ) = 4
c d
deg( d ) = 1
deg( b ) = 6 b

deg( e ) = 0
a g f e

20
Degree of a vertex
Find the degree of all the other vertices.
deg( a ) = 2 deg( c ) = 4 deg( f ) = 3 deg( g ) = 4
TOTAL of degrees = 2 + 4 + 3 + 4 + 6 + 1 + 0 = 20

c d
deg( b ) = 6 deg( d ) = 1
b

deg( e ) = 0
a g f e

21
Degree of a vertex
Find the degree of all the other vertices.
deg( a ) = 2 deg( c ) = 4 deg( f ) = 3 deg( g ) = 4
TOTAL of degrees = 2 + 4 + 3 + 4 + 6 + 1 + 0 = 20
TOTAL NUMBER OF EDGES = 10

c d
b deg( d ) = 1

deg( e ) = 0
a g f e
22
Handshaking Theorem

Theorem 1. Let G = (V, E) be an

undirected graph G with e edges.
Then å
deg(v) = 2e
vÎV

“The sum of the degrees over all the

vertices equals twice the number of
edges.”
NOTE: This applies even if multiple edges
and loops are present.

23
3. Some Special Simple Graphs

K4
K5

Complete graph Kn

24
3. Some Special Simple Graphs

C4
C5

Cycle Cn

25
3. Some Special Simple Graphs

W4
W5

Wheele Wn

26
4. New Graphs from Old Graphs

Definition. A subgraph of a graph G = (V, E)

is a graph H = (W, F) where W Í V and F Í E.

K5 C5
C5 is a subgraph of K5
27
 4. New Graphs from Old Graphs
Definition 7. The union of 2 simple graphs G1 = (V1 , E1 )
and G2 = (V2 , E2 ), denoted by G1 È G2 , is the simple
graph with vertex set V = V1 È V2 and edge set E = E1 È E2 .

c
c
c

b d
b d b d f
f
e
a e a e a

S5 C5 W5
W5 is the union of S5 and C5
28
Part 2: Representing Graphs,
Connectivity, and Euler Paths

1. Representing Graphs
2. Adjacency Matrices
3. Incidence Matrices
4. Isomorphism of Graphs
5. Paths
6. Connectedness
7. Euler Paths and Circuits

29
1. Representing Graphs

l One way to represent a graph without

multiple edges is to list all the edges
of this graph.
l Another way to represent a graph
with no multiple edges is to use
adjacency lists, which specify the
vertices that are adjacent to each
vertex of the graph.

30
2. Adjacency Matrix

A simple graph G = (V, E) with n vertices

can be represented by its adjacency
matrix,
A, where entry aij in row i and column j is

1 if { vi, vj } is an edge in G,
aij =
0 otherwise.

31
Finding the adjacency matrix

b d This graph has 6 vertices

f
a, b, c, d, e, f.
a e

W5 We can arrange them in that order.

32
 Finding the adjacency matrix
TO
c a b c d e f
FROM
a
b d 0 1 0 0 1 1
f b
c
a e
d
W5 e
f

There are edges from a to b, e, and f

33
 Finding the adjacency matrix
TO
c a b c d e f
FROM
a 0 1 0 0 1 1
b d
f b 1 0 1 0 0 1
c
a e
d
W5 e
f

There are edges from b to a, c, and f

34
 Finding the adjacency matrix
TO
c
a b c d e f
FROM

a 0 1 0 0 1 1
b d
f b 1 0 1 0 0 1
c 0 1 0 1 0 1
a e
d
W5 e
f

There are edges from c to b, d, and f

35
 Finding the adjacency matrix
COMPLETE THE ADJACENCY MATRIX . . .
TO

c FROM a b c d e f

a 0 1 0 0 1 1

b d
b 1 0 1 0 0 1
f c 0 1 0 1 0 1

a e
d 0 0 1 0 1 1
W5 e 1 0 0 1 0 1
f 1 1 1 1 1 0
Notice that this matrix is symmetric. i.e. aij = aji 36
4. Graph Isomorphism

Definition 1. An isomorphism between simple

graphs G1 and G2 is a bijection between the set
of vertices that preserves the adjacency list

37
 4. Graph Isomorphism
Note. Isomporphic simple graphs must have the same invariants:
üThe number of vertices
üThe number of edges
üThe degrees of the vertices

No vertex of deg 1
b b deg(e) = 1

c a
a c

d
e d e
Non-isomorphic graphs 38
 5. Connectivity-Paths
Definition 1. A path of length n from u to v in
an undirected graph is a sequence of edges
e1 = {u , x1}, e2 = {x1 , x2 }, . ., en = {xn – 1 , v}.

We also denote this path by: u x1 x2 . . . xn – 1 v

c
One path from a to e
b d This path passes through
f
vertices f and d in that order.
a e
The length of this path is 3
W5
39
 One path from a to a

c
This path passes through vertices f,
d, e, in that order. It has length 4.
b d
f
It is a circuit because it begins and
a e ends at the same vertex.

W5 It is called simple because it does not

contain the same edge more than
once.
40
6. Connectedness in Undirected Graphs

Definition 3. An undirected graph is called

connected if there is a path between every
pair of distinct vertices of the graph.
c
IS THIS GRAPH CONNECTED?

b d
f
YES
a e

W5
41
6. Connectedness in Undirected Graphs

Theorem . There is a simple path between

every pair of distinct vertices of a connected
undirected graph.

Proof. Let x0 x1 . . . xn be a path of shortest length joining

the vertices xo = u and x1 = v.
If this path is not simple, then there are 0 £ i < j such that
xi = xj.
Now deleting the edges xi xi+1, xi+1 xi+2, . . ., xj –1 xj, we
will obtain a path of shorter length joining u and v:
contradiction.

42
 Counting Paths between Vertices
Theorem. Let G be a graph with adjacency
matrix A with respect to the ordering v1 , v2 ,
. . . , vn .
The number of different paths of length r
from vi to vj , where r is a postive integer,
equals the entry in row i and column j of Ar.

NOTE. This applies with directed or undirected edges,

with multiple edges and loops allowed.

43
Example 0 1 1 0

a b 1 0 0 1
A=
1 0 0 1

c 0 1 1 0
d

8 0 0 8
Thus there are 8 0 8 8 0
different paths of 4
length 4 joining a
A =
0 8 8 0
and d
8 0 0 8
44
7. Euler Paths
Problem. The town of Königsberg was divided into four
sections by the branch of the Pregel River

These four sections are connected by seven bridges

45
7. Euler Paths

Question. Can one cross seven bridges and return to the

starting point without crossing any bridge twice?
In the eighteenth century, Euler solved this problem using
Graph Theory
46
 7. Euler Paths
C

A
D

B C
Euler modeled this problem using the
multigraph:
ü four sections correspond to four A
vertices A, B, C, D. D

ü each bridge corresponds to an edge B

47
7. Euler Paths

Definition. In a graph G an Euler path is a simple

path containing every edge of G. A simple circuit
which is also an Euler path is called an Euler
circuit.
Example. Does this graph have an
b
Euler circuit? a

Solution. An Euler circuit is e

abedcea d

c
48
 7. Euler Paths

Theorem. A connected multigraph has an Euler

circuit if and only if each vertex has even degree.

Proof. When an Euler circuit passes

by a vertex, it arrives by an edge a b
and leaves by a different edge.
e
Therefore the degree of the vertex
d
increases by 2 units. c

deg(e) = 0 + 2 + … =2+2=4
49
 7. Euler Paths
C
Example. All vertices of the multigraph
corresponding to the Königsberg
problem have odd degree so there is no A D
Euler circuit. Thus the Problem has no
solution B
Example. All four vertices of this graph have dgree 3
b
a
So there is no Euler circuit.

Thus we cannot draw it without

d
removing the pen head c 50
 7. Euler Paths
e
Example. This graph has two vertices of
degree 3, namely a and d
b c
So there is no Euler circuit

However there is an Euler path

abcdaceb d
a

Therefore e can draw this without removing the pen head

The fact that this graph has exactly two vertices of odd
degree is not an incidence. In fact we have
51
 7. Euler Paths
Theorem. A connected multigraph has an Euler path that is not
an Euler circuit if and only if there are exactly two vertices of
odd degree.
e
Proof. As in the last Theorem, the intermediary
vertices passed by an Euler path has even degree.
b c
At the starting vertex a, the degree increases
by 1 units when it leaves.
In any subsequent visit to a, deg(a) increases
by 2. So deg(a) is odd.
Similarly degree of ending vertex d is odd. a d
52
7. Algorithm for finding Euler Circuit
Step 1: Start from any v to find Circuit C
Step 2: Delete the edges in C out of G and alone vertices.
Step 3: If G=Ø then C is Euler Circuit of G.
Step 4: Find the sharing vertices v of C and G:
- Sort C starting from v.
- Start from v, find Circuit C'.
- Connect C’ into C.
- Return Step 2.

53
7. Algorithm for finding Euler Circuit
Example: Given G=(V, E) as follows:
a) Prove G is an Euler graph.
b) Find Euler Circuit C of G
a
b c

d e f

g h i j
54
7. Algorithm for finding Euler Circuit

Solution:
a) G is connected and all vertices have even
degree.
a
b c

d e f

g h i j
55
7. Algorithm for finding Euler Circuit

Solution:
b) Starting from vertex a,
C = (a, b, d, g, h, i, j, f, c, a).
a
b c

d f

g h i j
56
7. Algorithm for finding Euler Circuit
Solution:
- Delete edge on C out of G
a
b c

d e f

g h i j
- Delete the alone vertices: a, g, j. 57
7. Algorithm for finding Euler Circuit
Solution:
After deleting the alone vertices: a, g, j.
The remaining graph is G1

b c

d e f

h i

58
7. Algorithm for finding Euler Circuit
C and G1 have the same vertex b.
Sort C starting from b b c
C=(b, d, g, h, i, j, f, c, a, b).
e f
G1 has circuit starting from b, d
C1=( b, c, e, b).
h i
Connect C1 into C,
C=(b, d, g, h, i, j, f, c, a, b, c, e, b).

59
7. Algorithm for finding Euler Circuit

The remaining
graph is G2

d e f

h i

60
7. Algorithm for finding Euler Circuit
C and G2 have sharing vertex d.
Sort C starting from d, d e f
C= (d, g, h, i, j, f, c, a, b, c, e, b, d).
On G2 has circuit starting from d, h i
C2 = ( d, e, f, i, e, h, d).
Connect C2 into C,
C=(d, g, h, i, j, f, c, a, b, c, e, b, d, e, f, i, e, h, d).
G3=Ø, C is the final Euler circuit that we want to find.

61
7. Algorithm for finding Euler Circuit

C=(a, b, c, e, b, d, e, f, i, e, h, d , g, h, i, j, f, c, a).
a
b c

d e f

g h i j

62
 CW Assignment.
l 1. Find the number of edges, number of vertices,
and degree of each vertex:

l 2. Find the adjacency matrix of multigraphs:

63
Homework.
l Pages 608-609: 6, 8, 10
l Pages 618-619:10, 20, 58
l Pages 644-645: 14, 16, 20
l Implement the algorithm
EulerCircuit.C/C++ following the
description in slides 53 to 62.
Deadline: before 9:00PM May 12th 2018

64