NETWORK IN GRAPH THEORY

MATHEMATICS FORM 5 KSSM

PREPARED BY: TEACHER_AZLINA

 Recognise and
explain a networ k
Mr. Manan is a new security as a g r aph
guard in your residential area.
Every night, he has to go
around on every street to
ensure the safety of
homeowners. As the head of
the residence, help Mr. Manan
by drawing all the streets to
give Mr. Manan a picture to
get around that night.
This pictures is
Click here
called a graph
To do so, draw a simple line
Site plan of your residential area for each street and put a dot
where the streets intersect.
Back

Hide plan
 Recognise and
explain a networ k
vertex as a g r aph
Region, towns, cities or
individuals, groups, organisation (i) Graph is a series of dots
either linked or not to
each other by lines.
(ii) Point is known as vertex
linked and the line joining two
vertices as edge.
Not linked

edge
Physical connection like roads,
streets, highways, railway lines or
type of relationships such as
friends, colleague or families.
 Recognise and
YES
explain a networ k
vertex as a g r aph
Region, towns, cities or
individuals, groups, organisation (i) Graph is a series of dots
either linked or not to
each other by lines.
(ii) Point is known as vertex
linked and the line joining two
vertices as edge.
Not linked (iii) Network is a graph
which has at least a pair
of connected dots.
edge
Physical connection like roads,
streets, highways, railway lines or
type of relationships such as
friends, colleague or families.

vertex
Region, towns, cities or
individuals, groups, organisation
Simple graph
Recognise and
explain a networ k
as a g r aph
(i) Graph is a series of dots
either linked or not to
each other by lines.

Not a simple graph

linked
Not linked
edge
Physical connection like roads,
streets, highways, railway lines or
type of relationships such as
friends, colleague or families.
(ii) Point is known as vertex
and the line joining two
vertices as edge.
Multiple edges (iii) Network is a graph
Involved 2 vertices and the which has at least a pair
vertices are connected by more of connected dots.
than 1 edge
(iv) A simple graph is a
graph, without loops or
multiple edges.
loop
an edge that starts and finishes
at the same vertex
 Example 1 Counting the
number of
The diagram shows a Graph P. ver tices, edges
and the de g r ee of
(a) Is the graph a simple graph? each ver tex
A simple graph (i) Graph is a series of dots
either linked or not to
(b) List the vertices and state the number of vertices. each other by lines.
(ii) Point is known as vertex
V = {A, B, C, D, E} and the line joining two
vertices as edge.
n(V) = 5
(iii) Network is a graph
(c) List the edges and state the number of edges. which has at least a pair
of connected dots.
E = {(A, B), (A, D), (B, D), (C, D)} (iv) A simple graph is a
graph, without loops or
n(E) = 4 (A, B) = (B, A). Write once 𝚺𝒅 𝑽 = 𝟐𝑬 multiple edges.
= 2(8)
(v) The degree of a vertex
(d) On the table provided, determine the degree of each vertex. is the number of edges
that are connected to
Vertex A B C D E 𝚺𝒅(𝒗) other vertices.
Degree, d 2 + 2 + 1 + 3 + 0 = 8
 Example 2 Counting the
number of
The diagram show Graph Q. ver tices, edges
and the de g r ee of
(a) Is the graph a simple graph? each ver tex
Not a simple graph (i) Graph is a series of dots
either linked or not to
(b) List the vertices and state the number of vertices. each other by lines.
(ii) Point is known as vertex
V = {A, B, C, D} and the line joining two
vertices as edge.
n(V) = 4
(iii) Network is a graph
(c) List the edges and state the number of edges. which has at least a pair
of connected dots.
E = {(A, B), (A, B), (A, C), (B, C), (B, D), (C, C) } (iv) A simple graph is a
graph, without loops or
n(E) = 6 Repeat the same edge multiple edges.
(v) The degree of a vertex
(d) On the table provided, determine the degree of each vertex. is the number of edges
that are connected to
Vertex A B C D 𝑠𝑡𝑎𝑡𝑒 𝑡ℎ𝑒 𝑠𝑢𝑚 𝑜𝑓 𝑑𝑒𝑔𝑟𝑒𝑒? other vertices.
Degree, d 3 4 4 1 𝚺𝒅 𝒗 = 𝟐(𝟔)
= 𝟏𝟐 𝚺𝒅 𝒗 = 𝟐𝑬
12
 Example 3 Counting the
number of
For Each of the following graphs, determine ver tices, edges
and the de g r ee of
(i) 𝑉 and 𝑛 𝑉 .
each ver tex
(ii) 𝐸 and 𝑛 𝐸
(iii) 𝑑 𝑣 and σ 𝑑(𝑣) (i) Graph is a series of dots
either linked or not to
each other by lines.
(i) V = {1, 2, 3, 4, 5, 6} (ii) Point is known as vertex
n(V) = 6 and the line joining two
vertices as edge.
(ii) E = {(1, 2), (1, 5), (2, 3), (2, 4), (3, 4), (4, 5), (5, 6)} (iii) Network is a graph
n(E) = 7 which has at least a pair
of connected dots.
(iv) A simple graph is a
(iii) Degree of vertex: d(1) = 2 σ 𝑑(𝑣) = 2(7) graph, without loops or
d(2) = 3 = 14 multiple edges.
d(3) = 2 (v) The degree of a vertex
d(4) = 3 is the number of edges
d(5) = 3 that are connected to
d(6) = 1 other vertices.
Sum = 14
𝚺𝒅 𝒗 = 𝟐𝑬
 Example 4 Counting the
number of
For Each of the following graphs, determine ver tices, edges
and the de g r ee of
(i) 𝑉 and 𝑛 𝑉 .
each ver tex
(ii) 𝐸 and 𝑛 𝐸
(iii) 𝑑 𝑣 and σ 𝑑(𝑣) (i) Graph is a series of dots
either linked or not to
each other by lines.
(i) V = {P, Q, R, S, T} (ii) Point is known as vertex
n(V) = 5 and the line joining two
vertices as edge.
(ii) E = {(P, Q), (P, T), (P, T), (Q, T), (Q, R), (Q, S), (S, T), (S, S), (S, R), (R, R)} (iii) Network is a graph
n(E) = 10 which has at least a pair
of connected dots.
(iv) A simple graph is a
(iii) Degree of vertex: d(P) = 3 σ 𝑑(𝑣) = 2(10) graph, without loops or
d(Q) = 4 = 20 multiple edges.
d(R) = 4 (v) The degree of a vertex
d(S) = 5 is the number of edges
d(T) = 4 that are connected to
Sum = 20 other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
Example 5 Counting the
number of
For Each of the following graphs, determine 𝑛 𝑉 , 𝑛 𝐸 and σ 𝑑(𝑣) ver tices, edges
and the de g r ee of
(a) n(V) = 7 each ver tex

n(E) = 7 (i) Graph is a series of dots

either linked or not to
each other by lines.
σ 𝑑(𝑣) = 2(7)
(ii) Point is known as vertex
= 14 and the line joining two
vertices as edge.
(iii) Network is a graph
(b) which has at least a pair
of connected dots.
n(V) = 4 (iv) A simple graph is a
graph, without loops or
n(E) = 8 multiple edges.
(v) The degree of a vertex
σ 𝑑(𝑣) = 2(8) is the number of edges
that are connected to
= 16
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 5 Dr aw a networ k
based on ver tices
Determine whether the following pairs of vertices and edges are simple graphs and edges
or graphs with loops and multiple edges. Then draw the graph.
(a) V = {1, 2, 3, 4, 5}
A simple graph (i) Graph is a series of dots
E = {(1, 2), (1, 4), (1, 5), (2, 3), (2, 4), (3, 4)} either linked or not to
each other by lines.
(ii) Point is known as vertex
2 and the line joining two
3 vertices as edge.
(iii) Network is a graph
1 which has at least a pair
of connected dots.
(iv) A simple graph is a
4 graph, without loops or
multiple edges.
5 (v) The degree of a vertex
is the number of edges
that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 5 Dr aw a networ k
based on ver tices
Determine whether the following pairs of vertices and edges are simple graphs and edges
or graphs with loops and multiple edges. Then draw the graph.

(b) V = {P, Q, R, S}
(i) Graph is a series of dots
E = {(P, P), (P, Q), (P, S), (Q, S), (Q, S), (Q, R), (S, R), (R, R)} either linked or not to
each other by lines.
A graph with loops and multiple edges (ii) Point is known as vertex
and the line joining two
Q vertices as edge.
(iii) Network is a graph
P which has at least a pair
R of connected dots.
(iv) A simple graph is a
graph, without loops or
multiple edges.
(v) The degree of a vertex
S is the number of edges
that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 5 Dr aw a networ k
based on ver tices
Determine whether the following pairs of vertices and edges are simple graphs and edges
or graphs with loops and multiple edges. Then draw the graph.

(c) V = {P, Q, R, S, T, U}
(i) Graph is a series of dots
E = {(P, U), (P, T), (Q, T), (Q, S), (R, S), (R, U)} either linked or not to
each other by lines.
A simple graph (ii) Point is known as vertex
and the line joining two
Q R vertices as edge.
(iii) Network is a graph
which has at least a pair
P of connected dots.
S (iv) A simple graph is a
graph, without loops or
multiple edges.
(v) The degree of a vertex
U T is the number of edges
that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 5 Dr aw a networ k
based on ver tices
Determine whether the following pairs of vertices and edges are simple graphs and edges
or graphs with loops and multiple edges. Then draw the graph.

(d) V = {1, 2, 3, 4, 5, 6, 7}
(i) Graph is a series of dots
E = {(1, 6), (1, 6), (2, 7), (2, 7), (5, 7), (5, 7), (3, 4), (3, 4), (1, 7), (6, 7), (3, 7), (4, 7)} either linked or not to
each other by lines.
A graph with multiple edges. (ii) Point is known as vertex
and the line joining two
2 vertices as edge.
1 3 (iii) Network is a graph
which has at least a pair
of connected dots.
7 (iv) A simple graph is a
graph, without loops or
multiple edges.
6 4 (v) The degree of a vertex
is the number of edges
5 that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 6 Dr aw a networ k
based on ver tices
The following numbers is the possible degree of a simple graph. and edges
(a) 2, 3, 2, 1, 3

Determine (i) Graph is a series of dots

(i) the number of vertices, n(V) = 5 either linked or not to
each other by lines.
(ii) Point is known as vertex
(ii) the sum of degrees. = 2 + 3 + 2 + 1 + 3 and the line joining two
= 11 vertices as edge.
(iii) Network is a graph
(iii) Then state whether the following degree of vertices are which has at least a pair
possible to be drawn? of connected dots.
(iv) A simple graph is a
The graph cannot be drawn because the graph, without loops or
sum of degrees is odd. multiple edges.
(v) The degree of a vertex
is the number of edges
that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 6 Dr aw a networ k
based on ver tices
The following numbers is the possible degree of a simple graph. and edges
(b) 1, 2, 1, 3, 3, 2

Determine (i) Graph is a series of dots

(i) the number of vertices, n(V) = 6 either linked or not to
each other by lines.
(ii) Point is known as vertex
(ii) the sum of degrees. = 1 + 2 + 1 + 3 + 3 + 2 and the line joining two
= 12 vertices as edge.
(iii) Network is a graph
(iii) Then state whether the following degree of vertices are which has at least a pair
possible to be drawn? of connected dots.
The graph can be drawn because the sum (iv) A simple graph is a
graph, without loops or
of degrees is even. 1 5 multiple edges.
Start with the biggest degree (v) The degree of a vertex
is the number of edges
3 4 6 that are connected to
other vertices.

2 𝚺𝒅 𝒗 = 𝟐𝑬
 Example 7 Dr aw a networ k
based on ver tices
Draw a graph with loops and multiple edges with the given degrees of vertices. and edges

(a) 4, 2, 4, 4

Start with the biggest degree (i) Graph is a series of dots

either linked or not to
each other by lines.
(ii) Point is known as vertex
2 and the line joining two
vertices as edge.
1 3 (iii) Network is a graph
which has at least a pair
of connected dots.
(iv) A simple graph is a
4
graph, without loops or
multiple edges.
(v) The degree of a vertex
is the number of edges
that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
 Example 7 Dr aw a networ k
based on ver tices
Draw a graph with loops and multiple edges with the given degrees of vertices. and edges

(a) 5, 3, 4, 3, 1

Start with the biggest degree (i) Graph is a series of dots

either linked or not to
each other by lines.
(ii) Point is known as vertex
and the line joining two
vertices as edge.
1 2 (iii) Network is a graph
which has at least a pair
of connected dots.
5
(iv) A simple graph is a
graph, without loops or
multiple edges.
(v) The degree of a vertex
4 is the number of edges
3 that are connected to
other vertices.

𝚺𝒅 𝒗 = 𝟐𝑬
Textbook
Exercise
Page 134
NO 1 - 6