Math 4t

Network in Graph Theory

5.1
 5.1

Network
Part 1
2
 objectives

Students should be able to :

Identify and explain a network as a graph.

3
Network in your daily life

4
 Apakah itu Rangkaian?
● Dalam bidang Matematik, graf yang ditafsirkan sebagai suatu siri bintik sama ada
berkait atau tidak antara satu sama lain melalui garis.
● Bintik dikenali sebagai bucu dan garis yang mengaitkan dua bucu ialah tepi.
● Rangkaian merupakan sebahagian daripada graf dengan keadaan bucu dan tepi
mempunyai sifat tersendiri.
Apakah itu Graf?
 BUCU

TEPI
 Apakah itu Rangkaian?
● Rangkaian merupakan sebahagian daripada graf dengan
keadaan bucu dan tepi mempunyai sifat tersendiri.
 2.1 Network
● Graph, G can be written in the form of G = (V , E)
● V and E can be represented by using the set notation as follows,
V = { v1 , v2 . . . vn } , n = total of vertices in the graph
E = { ( a1 , b1 ) , ( a2 , b2 ) . . . ( an , bn ) } , n = total of edges in the graph

A B
V= {A, B , C, D E = { (A,B),(B,C),(C,D),(A,D) }
} n(E) = 4
n(V) = 4
D C

9
Determine V, n(V), E and n(E) for the following graph

V = { P, Q , R }
n(V) = 3

E = { (P,Q),(P,R),(Q,R) }
n(E) = 3
R Q

10
 Determine V, n(V), E and n(E) for the following graph

W X V = { V,W,X,Y,Z}
n(V) = 5

E = { (W,X),(W,Y),(X,Y),(Y,Z),
(V,Y) }
V Y Z n(E) = 5

11
Determine V, n(V), E and n(E) for the following graph

A B

V = { A,B,C,D,E}
n(V) = 5

C
E = { (A,B),(A,D),(A,C),(B,C),
(B,E),(D,E),(C,E),(C,D) }
D E n(E) = 8

12
 SIMPLE GRAPH

Simple graph is an undirected graph without loops or multiple edges

13
 2.1 Network
● Loop involves only one vertex where edge is in shape of circle or curve
that return to the original vertex.
● Multiple edges are two or more edges connecting to the same two
vertices.

P V = { P, Q, R }
n(V) = 3

E = { (P,Q),(Q,R),(P,R),(P,R),(Q,Q) }
n(E) = 5
R Q
14
Draw a graph with multiple edges and loops based on the given information

V= { A,B,C,D }
E = { (A,A),(A,B),(A,C),(B,C),(B,C),(B,D),(C,D) }
A
A B
B

D C
C D

15
 2.1 Network
● Degree, d is a number of edges that connected to the vertex.
● The degree of each loop is two
● The sum of degrees is twice the number of edges,
Σd(v) = 2E

P Σd(v) = 2E d(P) = 3
Σd(v) = 2 x 5 d(Q) = 4
= 10 d(R) = 3

R Q
16
Determine the degree each vertex and the sum of degrees in the following
graph

A B Σd(v) = 2E
d(A) = 2
d(B) = 5 Σd(v) = 2 x 9
d(C) = 4 = 18
d(D) = 3
C d(E) = 4
E
D

17
Draw a graph with multiple edges and loops based on the degree given

2, 6, 2, 6

18
 “
End of 5.1 Part 1

19
Please Scan The QR Code

20