IPG KAMPUS IPOH Program Pensiswazahan Guru MTE3104 Matematik Keputusan

INTERAKSI 3

An Introduction to Graph Theory

oleh

En Murugiah & Cik Tang Swee Khuan

diadaptasi dari Discrete Maths by R.S. Chang Dept CSIE, NDHU
Discrete Math by R.S. Chang, Dept. CSIE, NDHU 1

The Seven Bridges of Konigsberg

New Pregel River

Kneipkof Island

Pregel River
a

Old Pregel River

b c

Find a way to walk about the city so as to cross each bridge exactly once and then return to the starting point.
2

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

Undirected graph Loop (GELUNG) isolated vertex Directed graph

multiple edges
adjacent simple graph (GRAF RINGKAS): an undirected graph without loop or multiple edges Degree/order (DARJAH/PERINGKAT) of a vertex: number of edges connected
Discrete Math by R.S. Chang, Dept. CSIE, NDHU 3

Definitions and Examples

a

x y walk: no restriction a-b-d-a-b-c path: no vertex can be repeated a-b-c-d-e trail: no edge can be repeated a-b-c-d-e-b-d
closed if x=y closed path: cycle (KITAR) (a-b-c-d-a)

d
c

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

degree/order of a vertex is the number of edges Incident on it

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

A simple graph (GRAF RINGKAS): no loops, no more than one edge (SISI) connecting any pair of vertices

A walk: a sequence of edges in which the end of one edge (except the last) is the beginning of the next
A trail is a walk in which no edge is repeated

A path is a trail in which no vertex is repeated

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

An incidence matrix is a way of representing graph by matrix. A B

A
B
D C

0
1

1
0

2
1

1
0

C
D

2
1

1
0

0
1

1
0
7

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

Connected graph a b a e b e disconnected with two components d c

d c

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Definitions and Examples

a

b
A complete graph is a simple graph in which every pair of vertices is connected by an edge c

e
K5

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

Planar Graphs
A graph (or multigraph) G is called planar if G can be drawn in the plane with its edges intersecting only at vertices of G.

K4

K5

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

10

Planar Graphs
Bipartite graph and complete bipartite graphs (Km,n) K4,4

K3,3 is not planar.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

11

Hamilton Paths and Cycles

a path or cycle that contain every vertex There is no known necessary and sufficient condition for a graph to be Hamiltonian.

a d g

b e h

c f i

There is a Hamilton path, but no Hamilton cycle.

Discrete Math by R.S. Chang, Dept. CSIE, NDHU

12