• Graf digunakan untuk merepresentasikan objek-objek diskrit

dan hubungan antara objek-objek tersebut.

• Gambar di bawah ini sebuah graf yang menyatakan peta

jaringan jalan raya yang menghubungkan sejumlah kota di
Provinsi Jawa Tengah.
Rembang
Kudus
Brebes Demak
Tegal Pemalang Kendal
Semarang
Pekalongan
Slawi Blora

Temanggung Purwodadi
Salatiga
Wonosobo
Purbalingga
Purwokerto
Sragen
Banjarnegara Boyolali Solo

Kroya Sukoharjo
Cilacap Kebumen Magelang
Klaten
Purworejo
Wonogiri

Tri Dayat, Drs, M.Pd. 1

• Sejarah Graf: masalah jembatan Königsberg (tahun 1736)

A D

Gambar 1. Masalah Jembatan Königsberg

• Graf yang merepresentasikan jembatan Königsberg:

Simpul (vertex) → menyatakan daratan
Sisi (edge) → menyatakan jembatan
• Bisakah setiap jembatan dilalui tepat sekali dan kembali lagi
ke tempat semula?
2
Konigsberg Bridge Problem Leonhard Euler
15 April 1707 – 18 September 1783

3
Graf G = (V, E), yang dalam hal ini:
V = himpunan tidak-kosong dari simpul-simpul (vertices)
= { v1 , v2 , ... , vn }
E = himpunan sisi (edges) yang menghubungkan sepasang
simpul
= {e1 , e2 , ... , en }

4
 1 1 1
e1 e4 e1 e4
e3 e3
e2 e2
2 3 2 3 2 e8
e6 e6 3
e5 e5
e7 e7
4 4 4

G1 G2 G3
Gambar 2. (a) graf sederhana, (b) graf ganda, dan (c) graf semu

Contoh 1. Pada Gambar 2, G1 adalah graf dengan

V = { 1, 2, 3, 4 } E = { (1, 2), (1, 3), (2, 3), (2, 4), (3, 4) }

G2 adalah graf dengan

V = { 1, 2, 3, 4 }
E = { (1, 2), (2, 3), (1, 3), (1, 3), (2, 4), (3, 4), (3, 4) }
= { e1, e2, e3, e4, e5, e6, e7}

G3 adalah graf dengan

V = { 1, 2, 3, 4 }
E = { (1, 2), (2, 3), (1, 3), (1, 3), (2, 4), (3, 4), (3, 4), (3, 3) }
= { e1, e2, e3, e4, e5, e6, e7, e8}
5
 1 1 1
e1 e4 e1 e4
e3 e3
e2 e2
2 3 2 3 2 e8
e6 e6 3
e5 e5
e7 e7
4 4 4

G1 G2 G3
Gambar 2. (a) graf sederhana, (b) graf ganda, dan (c) graf semu

• Pada G2, sisi e3 = (1, 3) dan sisi e4 = (1, 3) dinamakan sisi-

ganda (multiple edges atau paralel edges) karena kedua sisi
ini menghubungi dua buah simpul yang sama, yaitu simpul 1
dan simpul 3.

• Pada G3, sisi e8 = (3, 3) dinamakan gelang atau kalang (loop)

karena ia berawal dan berakhir pada simpul yang sama.
6
• Berdasarkan ada tidaknya gelang atau sisi ganda pada suatu
graf, maka graf digolongkan menjadi dua jenis:
1. Graf sederhana (simple graph).
Graf yang tidak mengandung gelang maupun sisi-ganda
dinamakan graf sederhana. G1 pada Gambar 2 adalah
contoh graf sederhana

2. Graf tak-sederhana (unsimple-graph).

Graf yang mengandung sisi ganda atau gelang dinamakan
graf tak-sederhana (unsimple graph). G2 dan G3 pada
Gambar 2 adalah contoh graf tak-sederhana

7
• Berdasarkan orientasi arah pada sisi, maka secara umum graf
dibedakan atas 2 jenis:
1. Graf tak-berarah (undirected graph)
Graf yang sisinya tidak mempunyai orientasi arah disebut
graf tak-berarah. Tiga buah graf pada Gambar 2 adalah
graf tak-berarah.

2. Graf berarah (directed graph atau digraph)

Graf yang setiap sisinya diberikan orientasi arah disebut
sebagai graf berarah. Dua buah graf pada Gambar 3 adalah
graf berarah.

8
 1 1

2 3 2 3

4 4

(a) G4 (b) G5

Gambar 3 (a) graf berarah, (b) graf-ganda berarah

9
1. Rangkaian listrik.

B B
A C A C

F F
E D E D

(a) (b)

10
2. Isomer senyawa kimia karbon
metana (CH4) etana (C2H6) propana (C3H8)

H C H

11
3. Transaksi konkuren pada basis data terpusat
Transaksi T0 menunggu transaksi T1 dan T2
Transaksi T2 menunggu transaksi T1
Transaksi T1 menunggu transaksi T3
Transaksi T3 menunggu transaksi T2
T1

T3
T0

T2

deadlock!

12
4. Pengujian program
read(x);
while x <> 9999 do
begin
if x < 0 then
writeln(‘Masukan tidak boleh negatif’)
else
x:=x+10;
read(x);
end;
writeln(x);

1 2
6 7
3

Keterangan: 1 : read(x) 5 : x := x + 10
2 : x <> 9999 6 : read(x)
3:x<0 7 : writeln(x)
4 : writeln(‘Masukan tidak boleh negatif’);

13
5. Terapan graf pada teori otomata.
Mesin jaja (vending machine)
10

P P P 10
5
5
5 5
10
a b c d
10

Keterangan:
a : 0 sen dimasukkan
b : 5 sen dimasukkan
c : 10 sen dimasukkan
d : 15 sen atau lebih dimasukkan

14
 Gambarkan graf yang menggambarkan
sistem pertandingan ½ kompetisi (round-
robin tournaments) yang diikuti oleh 6 tim.

15
Course : Linear and Discrete Mathematics
Effective Period : September 2022

Graph and Trees

Session 13-14
Acknowledgement

These slides have been adapted

from :

Susanna S.Epp, “ Discrete

Mathematics with Applications”,
5th edition,2020, Cengage,
Boston, USA, ISBN
9781337694193

2
 Learning Objectives

LO 3 : Apply the Theory of graph, tree and matrices

for real problems.

- Student able to apply the concept of graph and

tree.
- Student able to explain representation of matrices
 Contents
1
Trail, Paths, and
2 Circuit
Spanning Trees
3

4 Matrix
Representation of
Shortest Path
Graphs
Algorithm
 Graph
In this lesson, we study about Graph Theory and Trees.
The discussion concepts such as the degree of a
vertex,Euler and Hamiltonian circuits, properties of
rooted trees spanning trees, and shortest paths in graphs

Let 𝐺 = (𝑉; 𝐸) be a graph with vertex set 𝑉 = 𝑉 𝐺

and edge set 𝐸 = 𝐸 𝐺 . In the graph theory, the edge
connected two vertices.

The application of graph theory and trees can be found

in artificial intelligence, chemistry, scheduling problems,
and transportation systems.
 A simple graph is a graph that does Special Graph
not have any loops or parallel edges.

Let n be a positive
integer. A complete
graph on n vertices,
denoted 𝐾𝑛 is a
simple
graph with n vertices A bipartite graph, also called a
and exactly one edge bigraph, is a set of graph vertices
connecting each pair decomposed into two disjoint
of distinct vertices. sets such that no two graph
vertices within the same set are
adjacent. It’s denoted by 𝐾𝑚,𝑛 .
Example graph 𝐾3,2 and 𝐾3,3
 Order, size, and degree of
graph
The order of a graph G is the cardinality of its
vertex set, it’s denoted by |𝑉 𝐺 |. The order of
graph 𝐾4 is |𝑉 𝐺 | = 4.

The size of a graph is the cardinality of its edge set.

The size of graph 𝐾4 is |𝐸 𝐺 | = 6.

The degree of graph is the number of edges that

are incident on v, with an edge that is a loop
counted twice, , it’s denoted by 𝑑𝐺 (𝑣) = 𝑑(𝑣).
The degree of graph 𝐾4 are 𝑑(𝑣1 ) = 3, 𝑑(𝑣2 ) =
3, 𝑑(𝑣3 ) = 3 and 𝑑(𝑣4 ) =3.
Total degree of 𝐾4 = 𝑑(𝑣1 ) + 𝑑(𝑣2 ) + 𝑑(𝑣3 ) +
𝑑(𝑣4 ) =12
Let G be a graph, and let 𝑣 and 𝑤 be vertices in G.
A Walk from 𝑣 a to w is a finite alternating sequence of adjacent vertices and edges
of
G. Thus a walk has the form :
𝑣0𝑒1𝑣1𝑒2 … 𝑣𝑛−1 𝑒𝑛𝑣𝑛,
where the 𝑣’s represent vertices, the e’s represent edges.

A Trail from 𝑣 to 𝑤 is a walk from v to w that does not contain a repeated edge.

A Path from 𝑣 to 𝑤 is a trail that does not contain a repeated vertex.

A Closed walk is a walk that starts and ends at the same vertex.

Circuit is a closed walk that contains at least one edge and does not contain a
repeated edge.

A Simple circuit is a circuit that does not have any other repeated vertex except the
first and last.
Walk (Lintasan)

• Walk (Lintasan) • Lintasan adalah urutan simpul dan ruas

yang bergantian tidak kosong dan berhingga yang dimulai
dan diakhiri dengan simpul, dimana setiap ruas
menghubungkan dua simpul (sebelum dan sesudah ruas
tersebut). Dalam lintasan, simpul dan ruas bisa diulang.
• Lintasan dengan panjang n dari simpul u ke w dituliskan
sebagai: v 1 , e 1 , v 2 , e 2 , ..., v n-1 , e n-1 , v n , e n
dengan v 1 = u, v n = w, v j-i dan v i adalah simpul- simpul
ujung ruas e i .
Trail (Tapak)

• Trail merupakan lintasan dimana semua ruasnya

berlainan (tidak diulang), sedangkan simpulnya boleh
diulang.
• Trail dengan panjang n dari simpul u ke w dituliskan
sebagai: v 1 , e 1 , v 2 , e 2 , ..., v n-1 , e n-1 , v n , e n
dengan v 1 = u, v n = w, e i ≠ e j untuk i ≠ j
Path (Jalur)

• Path merupakan tapak dimana semua simpulnya

berlainan, kecuali jika jalur tersebut merupakan
jalur tertutup sehingga simpul awal sama dengan
simpul akhir.
• Path dengan panjang n dari simpul u ke w
dituliskan sebagai: v 1 , e 1 , v 2 , e 2 , ..., e n-1 , v
n-1 , e n , v n dengan v 1 = u, v n = w, e i ≠ e j untuk
i ≠ j dan v k ≠ v m untuk k ≠ m.
Sirkuit

• Sirkuit adalah path/jalur yang tertutup.

• Sirkuit dengan panjang n dari simpul u kembali ke u
lagi dituliskan sebagai: v 1 , e 1 , v 2 , e 2 , ..., e n- 1 , v
n-1 , e n , v n dengan v 1 = v n = u, e i ≠ e j untuk i ≠ j
dan v k ≠ v m untuk k ≠ m.
From the Figure,
a. A trail. This walk has a repeated vertex but does not have a repeated
edge.
b. A walk. it has a repeated edge hence it is not trail.
c. A circuit or closed trail. This walk starts and ends at v2, contains at
least one edge, and does not have a repeated edge. It has a has a
repeated vertex in middle, v3.
d. A simple circuit or closed walk. This walk starts and ends at v2,
contains at least one edge, does not have a repeated edge, and does
not have a repeated vertex.
e. A Closed Walk. It is not a circuit because edge e1 is repeated.
f. One vertex . closed walk.
Chromatic Number
The chromatic number of a graph is the smallest number of colors
needed to color
the vertices of so that no two adjacent vertices share the same color .
It’s denoted by
𝜒(𝐺).
In 1967, Welsh and Powell introduced an upper bound to the chromatic
number 𝜒(𝐺)
of a graph 𝐺.
 Graph Coloring

Example 1:
What are the chromatic numbers of the graphs G and H shown in Figure
below

𝜒(G)=3

𝜒(H)=4

16
 The Chromatic number of Kn

A coloring of Kn can be constructed using n colors by assigning a

different color to each vertex

𝜒(Kn) = n
Example :

𝜒(K5) = 5

A coloring of K5.
17
 The chromatic number of the
complete bipartite graph Km,n
The number of colors needed may seem to depend on m and n.
Because edges connect only a vertex from the set of m vertices and a
vertex from the set of n vertices, no two adjacent vertices have the
same color.

𝜒(Km,n) = 2.
Example :

𝜒(K3,4) = 2.

A coloring of K3,4.
18
 The chromatic number of the
graph Cn, where n ≥ 3

𝜒(Cn) = 2 if n is an even positive integer with n ≥ 4 and

𝜒(Cn) = 3 if n is an odd positive integer with n ≥ 3.
Example :
Colorings of C5 and C6.

𝜒(C6) = 2 𝜒(C5) = 3
19
Vertex Coloring by The Welch-Powell
Algorithm

The Welch-Powell Algorithm consist of the following steps :

1. Finds the degree for each vertex.

2. List the vertices in order of descending degree.

3. Color the first vertex in the list.

4. Go down the list and color every vertex not connected to the
colored vertices above the same color. Then cross out all colored
vertices in the list.

5. Repeat the process on the uncolored vertices with a new color

– always working in descending order of valence until all vertices
have been colored.
 Solution :
1. List the vertices in order of descending degree.
Example :
2. Consider that 𝒘𝟏 and 𝒘𝟐 have same number and
Determine the chromatic
the greatest degree of graph 𝐾3,2 . Starting coloring
number of graph 𝐾3,2
red to 𝒘𝟏 .
3. Checking the vertices are not connected with 𝒘𝟏 .
The vertex 𝒘𝟐 is just not connected to 𝒘𝟏 .
4. Repeat the process, we get 𝒗𝟏 . Give a green color to
𝒗𝟏 . The vertices 𝒗𝟏 , 𝒗𝟐 and 𝒗𝟑 are not connected to
each other.
5. 𝜒 𝐺 = 2
Vertice 𝒘𝟏 𝒘𝟐 𝒗𝟏 𝒗𝟐 𝒗𝟑
s
Degree 3 3 2 2 2

Color Red Red Green Green Green

 Euler Circuit
E u LER CIRCUIT : Let 𝐺 be a graph. An Euler
circuit for 𝐺 is a circuit that contains every vertex
and every edge of 𝐺 .

CHECK : A graph 𝐺 has an Euler circuit if, and

only if, 𝐺 is connected and every vertex of 𝐺 has
positive even degree.

Example 1 : Consider the graph in

right side. The vertices 𝑣1 and 𝑣3
both have degree 3, which is odd.
this graph does not have an Euler
circuit.
 EXAMPLE 2 :Conside the graph 𝐺 below. Every vertex of
𝐺 has positive even degree.
Determine the Euler circuit from graph 𝐺

Starting from vertex 𝑎, the Euler circuit from graph 𝐺: a b c d e f h e g h j i d a.

 Hamiltonian Circuit

Hamiltonian Circuit Given a graph 𝐺, a Hamiltonian circuit for 𝐺 is a simple circuit

that includes
every vertex of 𝐺. That is, a Hamiltonian circuit for 𝐺 is a sequence of adjacent
vertices and
distinct edges in which every vertex of 𝐺 appears exactly once, except for the first
and the last,
which are the same.

Check If a graph 𝐺 has a Hamiltonian circuit, then 𝐺 has a subgraph 𝐻 with the
following
properties:
1. 𝐻 contains every vertex of 𝐺.
2. 𝐻 is connected.
3. 𝐻 has the same number of edges as vertices.
4. Every vertex of 𝐻 has degree 2.

APPLICATION : A Traveling Salesman Problem

 Tree
Definition A graph is called a tree if, and only if, it has no circuits and connected.

Theorems For any positive integer 𝑛, if 𝐺 is a connected graph with 𝑛 vertices and
𝑛 − 1 edges,
then 𝐺 is a tree.
Example

It has circuit
Tree
 Spanning Tree
Definition
A spanning tree for a graph 𝐺 is a subgraph of 𝐺 that contains every vertex of
𝐺 and is a tree.
Proposition
1. Every connected graph has a spanning tree.
2. Any two spanning trees for a graph have the same number of edges.

Example Solution
Find all spanning trees for the The graph G has one circuit 𝑣2𝑣1𝑣4𝑣2, and removal
graph 𝐺 pictured below. of any edge of the circuit gives a tree.

𝐺
 Minimum Spanning Tree
A weighted graph is a graph for which each edge has an associated positive real number
weight.

The sum of the weights of all the edges is the total weight of the graph.

A minimum spanning tree for a connected weighted graph is a spanning tree that has the
least possible total weight compared to all other spanning trees for the graph.

In 1956 and 1957 Joseph B. Kruskal and Robert C. Prim each described much more
efficient algorithms to construct minimum spanning trees.
 Kruskal’s Algorithm

Input: G [a connected weighted graph with n vertices, where n is a positive

integer]
Algorithm Body:
[Build a subgraph T of G to consist of all the vertices of G with edges added
in order of
increasing weight. At each stage, let 𝑚 be the number of edges of 𝑇 .]
1. Initialize T to have all the vertices of G and no edges.
2. Let 𝐸 be the set of all edges of G, and let 𝑚 ∶= 0.
3. while (m < n - 1)
3a. Find an edge e in E of least weight.
3b. Delete e from E.
3c. if addition of e to the edge set of T does not produce a circuit
then add e to the edge set of T and set 𝑚 ∶= 𝑚 + 1
end while
Output: T [T is a minimum spanning tree for G.]
Example : Describe the action of Kruskal’s algorithm on the graph
shown below, where n = 8.
 Solution
The Kruskal algorithm consists of the
following steps
Suppose the graph 𝐺 is a weighted
weight graph and connected
from the graph 𝐺 specify a subgraph
𝑇 that contains all points in and
does not contain edges
𝐺 Consecutively from the lowest to
the biggest weighted edge, add the
edge with the weight into subgraph
𝑇.
no edge added whose addition will
produce a circuit
𝑇 repeat these steps until a spanning
tree is formed
 From Chicago to
Lousiville has circuit
hence delete one edge

from the lowest weighted edge,

add the edge with the weight
into subgraph 𝑇
 REFERENCES

• Epp, S.Susanna., 2010. Discrete mathematics with applications. Cengage learning.

• Hammack, R.H., 2013. Book of proof. Richard Hammack.
• Bipartite graph http://mathworld.wolfram.com/BipartiteGraph.html
• Chromatic Number http://mathworld.wolfram.com/ChromaticNumber.html
• Social Media Network
https://www.maxpixel.net/Computer-Network-Social-Media-Connection-Network-3136897
• Network of facebook
https://www.maxpixel.net/Logo-Facebook-Social-Network-Google-Network-Social-3139201
• Vertex coloring (Welsch Powell Algorithm)
http://mrsleblancsmath.pbworks.com/w/file/fetch/46119304/vertex%20coloring%20algorithm.pd
Thank You