Scribd
Upload
66 views10 pages

C5 Network (Part 1)

A network is a graph with vertices and edges that have specific characteristics. A graph is made up of dots (vertices) connected by lines (edges). A network can model real world systems like transportation or social networks. Key terms introduced include vertex, edge, degree, simple graph, loop, and multiple edges. Examples show how to determine the number of vertices and edges, sum of degrees, and draw simple and non-simple graphs based on given degree information.

Uploaded by

USHA DEVI A/P LINGAPPAN Moe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
66 views10 pages

C5 Network (Part 1)

A network is a graph with vertices and edges that have specific characteristics. A graph is made up of dots (vertices) connected by lines (edges). A network can model real world systems like transportation or social networks. Key terms introduced include vertex, edge, degree, simple graph, loop, and multiple edges. Examples show how to determine the number of vertices and edges, sum of degrees, and draw simple and non-simple graphs based on given degree information.

Uploaded by

USHA DEVI A/P LINGAPPAN Moe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

22/6/2021 MATHEMATICS

CHAPTER 5
NETWORK IN GRAPH THEORY
THE PUPILS WILL BE ABLE TO:

 IDENTIFY AND EXPLAIN A NETWORK AS A GRAPH.

vertex multiple edge


edge degree / sum of degree
loop simple graph
OVERVIE
W Network In Graph Theory

Network

Graph

Graph with multiple edges and loops


Simple
Graph

Undirected Graph Unweighted Graph Directed Graph Weighted Graph


Example :
LAND TRANSPORT NETWOR
Vertex (V)
 City
 Town
 Region
 Buildings, etc

Edge (E)
 Roads
 Highways
 Railway track, etc

SOCIAL NETWORK
Vertex (V) Edge (E)
 Individual  Type of relationship
 Organization
 Group
Network In Graph Theory

 A graph is interpreted as a series of dots which are either linked or not linked to
one another by lines.
 A network is part of a graph with the vertices and edges having their own
characteristics. (Network a graph of at least 2 dots)
 Each dot is known as a vertex and the line joining two vertices is known as an edge.

E)
e(
g
Ed
degree Vertex (V)
Simple Graph Graph with multiple edges and loops
E
B
V A

C
Simple Graph E D
1 2 3 - has no loops and no multiple
edges. Loop
- The sum of degrees of the
4 graph is twice the number of
6 5 edges. Multiple edges
Σd(v) = 2(E)
Q R S

P
W V U T
Example : 1
For each of the graph, determine
(i) V and n(V)
(ii) E and n(E) d(1) = 2
(iii) Sum of degree d(2) = 3
d(3) = 3
1 2 3 d(4) = 2
d(5) = 4
Ʃd(V) = 2n(E)
d(6) = 2

4
Total = 16 =2×8
6 5  

V = {1, 2, 3, 4, 5, 6 }
  = 16
 
n(V) = 6
E = {(1,2),(1,6),(2,3),(2,5),(3,4),(3,5),(4,5),(5,6) }
n(E) = 8
Example : 2
For each of the graph, determine
(i) V and n(V)
(ii) E and n(E)
d(A) = 3
(iii) Sum of degree
d(B) = 5
d(C) = 4
A B
d(D) = 4
d(E) = 4
Ʃd(V) = 2n(E)
Total = 20

E D
C
  = 2 × 10
Sum  of degree for a

V = {A, B, C, D, E }   loop is 2
 
= 20
n(V) = 5  
 
E = {(A,B), (A,B), (A, E), (B,C), (B,D), (B,E), (C,C), (C,D), (D,E), (D,E)}
n(E) = 10
Example : 3
Draw a simple graph for the following number of degrees given
Example : 4
Draw a graph that has loop and multiple edge for the following number of degrees given

You might also like