21MDS42 – GRAPH THEORY

UNIT IV – DIRECTED GRAPH

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 1

UNIT - IV

DIRECTED GRAPH
Directed Graphs – Types of Directed Graphs –Digraphs and Binary
Relations – Directed Paths and Connectedness – Euler Graphs –
Adjacency Matrix of a Digraph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 2

 DIRECTED GRAPHS

• An edge ek between vertices vi and vj could be considered as going from

vertex vi to vertex vj or from vj to vi .

• Directed graphs–graphs in which edges have directions.

• A digraph is also referred to as an oriented graph.

• As in the case of undirected graphs, a vertex is represented by a point and

an edge by a line segment between vi and vj with an arrow directed from

vi to vj.
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 3
DIRECTED GRAPHS (DIGRAPH)
A directed graph (or a digraph for short) G consists of a set of vertices V
= {v1 , v2 , . . .}, a set of edges E = {e1 , e2 , . . .}, and a mapping Ψ that
maps every edge onto some ordered pair of vertices (vi , vj ).

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 4

 DIRECTED GRAPHS
• In a digraph an edge is not only incident on a
vertex, but is also incident out of a vertex and
incident into a vertex.
• The vertex vi , which edge ek is incident out of,
is called the initial vertex of ek .
• The vertex vj , which ek is incident into, is
called the terminal vertex of ek .
• In Fig. v5 is the initial vertex and v4 is the
terminal vertex of edge e7 .
• An edge for which the initial and terminal
vertices are the same forms a self-loop, such as
e5 .
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 5
 DEGREE OF THE VERTEX
• The number of edges incident out of a vertex vi is called out degree of
vi and it is denoted by d+(vi).
• The number of edges incident into vi is called in degree of vi and it is
denoted by d-(vi).

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 6

Theorem : Directed Graph
In any digraph G the sum of all in-degrees is equal to the sum of all out-
degrees, each sum being equal to the number of edges in G; that is,

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 7

 ISOLATED VERTEX
• An isolated vertex is a vertex in which the in-degree and the out-
degree are both equal to zero.

PENDANT VERTEX
• A vertex v in a digraph is called a pendant if it is of degree 1, i.e,
d+(v) + d-(v) = 1

• Vertex v3 in the figure is a pendant vertex.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 8

 Two directed edges are PARALLEL
• Two directed edges are said to be parallel if they are mapped onto the
same ordered pair of vertices.
• In the figure, edges e8 , e9 , and e10 are parallel, whereas edges e2 and
e3 are not.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 9

TYPES OF DIGRAPHS
1. Simple
2. Symmetric
3. Asymmetric
4. Simple symmetric
5. Simple asymmetric
6. Complete
7. Complete symmetric
8. Complete asymmetric
9. Balanced
10. Regular balanced
10
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE
SIMPLE DIGRAPH
• A digraph that has no self loop or no parallel edges is called a simple
digraph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 11

SYMMETRIC DIGRAPH
• Digraphs in which for every edge (a, b) (i.e., from vertex a to b) there
is also an edge (b, a).

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 12

ASYMMETRIC DIGRAPH
• A digraphs that have atmost one directed edge between a pair of
vertices but are allowed to have self loops are called asymmetric (or)
anti-symmetric digraphs.

v1 v2

v4 v3

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 13

SIMPLE SYMMETRIC DIGRAPH
• A digraph that is both simple and symmetric is called a simple
symmetric digraph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 14

SIMPLE ASYMMETRIC DIGRAPH
• A digraph that is both simple and asymmetric is called simple
asymmetric digraph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 15

COMPLETE DIGRAPH
• A complete undirected graph was defined as a simple graph in which
every vertex is joined to every other vertex exactly by one edge.
• It is a graph in which every vertex have same degree.

d+(x1) = 2
d+(x2) = 2
d+(x3) = 0
d+(x4) = 2
d-(x1) = 1
d-(x2) = 1
d-(x3) = 3
d-(x4) = 1
Sum of degrees of (+) and (-) for all vertices is same.
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 16
COMPLETE SYMMETRIC DIGRAPH
• It is a simple digraph in which there exists exactly one edge directed
from every vertex to every other vertex.

• In the figure, each vertex has same degree = 6.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 17
 COMPLETE ASYMMETRIC DIGRAPH
• It is an asymmetric digraph in which there is exactly one edge
between pair of vertices. A complete asymmetric digraph is also called
a tournament or a complete tournament

𝑣1

𝑣3 𝑣2
A complete asymmetric digraph of n vertices contains n(n – l)/2 edges,
but a complete symmetric digraph of n vertices contains n(n – 1) edges.
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 18
BALANCED DIGRAPHS
• A digraph is said to be balanced if for every vertex vi, the indegree
equals out-degree ,i.e , d+(vi) = d-(vi)
• A balanced digraph is also referred to as a pseudo symmetric digraph,
or an isograph
𝑣1

d+(v1) = 1
d+(v2) = 2
d+(v3) = 1
𝑣3 𝑣2
d-(v1) = 1
d-(v2) = 2
d-(v3) = 1

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 19

REGULAR BALANCED DIGRAPHS
• A balanced digraph is said to be regular if every vertex has the same
in-degree and out-degree as every other vertex.

𝑣1

𝑣2 𝑣3

• d+(vi) = d-(vi) = 2
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 20
REGULAR BALANCED DIGRAPHS
• d+(vi) = d-(vi) = 1

𝑣2

𝑣1 𝑣3

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 21

 ISOMORPHIC DIGRAPHS
• Two graphs are said to be isomorphic, not only must their
corresponding undirected graphs be isomorphic, but the direction of
the corresponding edges also be agreed.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 22

PROBLEM

• Check whether the following graphs are isomorphic or not :

B C v1 v2

G1 G2

A D V4 v3
• Soln :
Isomorphic undirected graphs :

G1 G2
Vertices 4 4
Edges 6 6 23
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE
SOLUTION
Degree :
G1 G2
d(D)=2 d(v1)=2
d(C)=2 d(v2)=4
d(B)=4 d(v3)=4
d(A)=4 d(v4)=2

One-to-one correspondence :
𝐴→𝐵→𝐶→𝐷
𝑣1 → 𝑣4 → 𝑣3 → 𝑣2

Therefore, G1 and G2 are isomorphic directed graphs.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 24
 SOLUTION
• Isomorphic directed graphs :

No/of vertices and edges are same. Only the difference is in in-degree
and out-degree.

Vertex G1 Vertex G2
I.D O.D I.D O.D
A d-(A)=1 d+(A)=1 v1 d-(v1)=1 d+(v1)=1
B d-(B)=1 d+(B)=1 v2 d-(v2)=2 d+(v2)=2
C d-(C)=2 d+(C)=2 v3 d-(v3)=2 d+(v3)=2
D d-(D)=2 d+(D)=2 v4 d-(v4)=1 d+(v4)=1

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 25

SOLUTION

One-to-one correspondence :
𝐴→𝐵→𝐶→𝐷
𝑣1 → 𝑣4 → 𝑣3 → 𝑣2

Therefore, G1 and G2 are isomorphic directed graphs.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 26

PROBLEM
• Check whether the following graphs are isomorphic or not :

ii)

• Soln :
Isomorphic undirected graphs :

G1 G2
Vertices 4 4
Edges 6 6 27
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE
SOLUTION
Degree :
G1 G2
d(D)=3 d(v1)=3
d(C)=3 d(v2)=3
d(B)=3 d(v3)=3
d(A)=3 d(v4)=3

One-to-one correspondence :
𝐴→𝐵→𝐶→𝐷
𝑣1 → 𝑣2 → 𝑣3 → 𝑣4

Therefore, G1 and G2 are isomorphic undirected graphs.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 28
 SOLUTION
• Isomorphic directed graphs :

Vertices and edges are same.

Vertex G1 Vertex G2
I.D O.D I.D O.D
A d-(A)=1 d+(A)=2 v1 d-(v1)=2 d+(v1)=1
B d-(B)=2 d+(B)=1 v2 d-(v2)=2 d+(v2)=1
C d-(C)=2 d+(C)=1 v3 d-(v3)=2 d+(v3)=1
D d-(D)=1 d+(D)=2 v4 d-(v4)=0 d+(v4)=3

Therefore, G1 and G2 are not isomorphic directed graphs.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 29
DI-GRAPHS AND BINARY RELATIONS
• BINARY RELATIONS :
A binary relation R from A → B is a set of ordered pairs where first
element is from set A and second from set B.
Eg :
A = {a,b} , B={1,2,3}
ARB = {(a,1),(a,2),(a,3),(b,1),(b,2),(b,3)}

30
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE
BINARY RELATIONS

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 31

TYPES OF BINARY RELATIONS

• Reflexive Relation :xiRxi

• Symmetric Relation :xiRxj holds, then xjRxj also holds

• Transitive Relation : xiRxj and xjRxk implies xiRxk .

• Equivalence Relation is equal to modulo m

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 32

 TYPES OF RELATION
1) Reflexive relation :
• For some relation R, it may happen that every element is in relation R
to itself.
Eg :
xiRxi
“is equal to”

Reflexive di-graphs :
• The digraph of a reflexive relation will have self loop at every vertex.
• A digraph in which no vertex has a self-loop is called an irreflexive
digraph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 33

 TYPES OF RELATION

2) Symmetric relation :

Eg :
i. “Is equal to” is both symmetric and reflexive.
ii. “Is spouse of” is symmetric.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 34

TYPES OF RELATION

Symmetric digraphs :
• The digraph of a symmetric relation is a symmetric digraph because
for every directed edge from vertex xi to xj, there is directed edge from
xj to xi

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 35

 TYPES OF RELATION
3) Transitive relation :
• A relation R is said to be transitive if for any 3 element, xi, xj, xk in the set,

V1 V2

• Eg :
i) “is greater than” - 7 R 5 & (5 R 3) ⇒ (7 R 3) V4 V3

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 36

Transitive directed graph
• The digraph of a transitive (but irreflexive and asymmetric) binary
relation is shown in Fig. 9-4.
• Note the triangular subgraphs.
• A digraph representing a transitive relation (on its vertex set) is called a
transitive directed graph.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 37

TYPES OF RELATION
4) Equivalence relation :
• A binary relation is called an equivalence relation if it is reflexive,
symmetric and transitive.
• The graph representing the equivalence relation is called equivalence
graph.

• Eg:
i. Is equal to
ii. Is congruent to
iii. Is isomorphic to
• In general, an equivalence relation on a set partitions the elements of the
set into classes (called equivalence classes) such that two elements are in
the same class if and only if they are related.
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 38
TYPES OF RELATION

4) Equivalence relation :
• X = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20}

R – is congruent to mod 3 ie num/3 =1, num/3 =2, num/3=0

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 39

Relation Matrices

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF

40
COMPUTING- DATA SCIENCE
DIRECTED PATHS AND CONNECTEDNESS
PATH:
• An open walk in which no vertex appears more than once is called a
path. v1 e1 v2 e5

• In the figure, e4 e6 e2
Path = v1e1v2e2v3
v4 e3 v3

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 41

WALK

• A directed walk from a vertex vi to vj is an alternative sequence of vertices

and edges, beginning with vi and ending with vj such that each edge is

oriented from the vertex preceding it to the vertex following it,

• i.e, no edge in a directed walk appears more than once,

but a vertex may appear more than once in the case of undirected graphs.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF

42
COMPUTING- DATA SCIENCE
SEMI-WALK
• A semi-walk in a directed graph is a walk in the corresponding
undirected graph but is not a directed walk.
• A walk in a digraph can mean either a directed walk or semi-walk.

Eg :
vie4v4e3v3 – semi-walk
v1e4v4e3v3e2v2e1v1 – closed semi-walk

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 43

CONNECTED DIGRAPH
• A digraph G is said to be connected if there is atleast one path between
every pair of vertices, otherwise G is disconnected.

• There are 3 types of connected digraphs.

i. Strongly connected.
ii. Weakly connected.
iii. Unilaterally connected.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 44

STRONGLY CONNECTED
• A digraph is said to be strongly connected, if there is a path from vi to
vj and from vj to vi or any pair of vertices of the graph.

A B
𝐴 → 𝐵 , B → A (B →C → A)
A →C(A →B →C) , C →A

A →D , D →A(D →B →C →A)
B →C , C →B(C →A →B)

D C
B →D(B →C →D) , D →B
C →D , D →C(D →B →C)
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 45
WEAKLY CONNECTED
• A digraph is said to be weakly connected if there is a path between
every 2 vertices in the underlying undirected graph.

A B A B

D C D C

A→ C , C → A
(No path exists). Path exists.
DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 46
UNILATERALLY CONNECTED
• A digraph is said to be unilaterally connected if for any pair of vertices
of the graph at least one of the pair of vertices is reachable from the
other vertices.
A B

𝐴 → 𝐵 ,B → A
A →C , C →A (C → D → A)
A →D , D →A
B →C , C →B
B →D , D →B (D → A → B)
D C
C →D , D →C

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 47

PROBLEM
• Find which of the following graphs are strongly, weakly and
unilaterally connected.
A B
i)
𝐴 → 𝐵 ,B → A
A →C(A → D →C) , C →A
A →D , D →A
B →C , C →B
B →D , D →B
C →D , D →C D C

Therefore, it is unilaterally connected.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF

48
COMPUTING- DATA SCIENCE
 Connectedness in a digraph
• Each maximal connected (weakly or strongly) subgraph of a digraph G
will still be called a component of G.
• But within each component of G the maximal strongly connected
subgraphs will be called the fragments of G (or strongly connected
fragments).
• Accessibility: In a digraph a vertex b is said to be accessible (or
reachable) from vertex a if there is a directed path from a to b. Clearly, a
digraph G is strongly connected if and only if every vertex in G is
accessible from every other vertex.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 49

Condensation
The condensation Gc of a digraph G is a digraph in which each strongly
connected fragment is replaced by a vertex, and all directed edges from one
strongly connected component to another are replaced by a single directed
edge.
Two observations can be made from the definition:
1. The condensation of a strongly connected digraph is simply a vertex.
2. The condensation of a digraph has no directed circuit.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 50

Condensation

condensation of the digraph G in Fig. 9-7 is shown in Fig. 9-8.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 51

PROBLEM 𝐴 → 𝐵 , B → A (B →F →A)
A →C(A → B →C) , C →A
A B
A →D , D →A
ii)
A →E(A →B → F →E) , 𝐸 →A
A →F(A →B →F) , F →A
F C B →C , C →B
B →D , D →B
B →E(B →F →E) , E →B
E D B →F , F →B(F →A →B)
C →D , D →C
C →E , E →C
C →F , F →C (F →A →B →C)
D →E , E →D
D →F , F →D
E →F , F → E

Therefore, it is weakly connected.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 52
PROBLEM
A
iii)

𝐴 → 𝐵 𝐴 → 𝐷 → 𝐵 ,B → A
D
A →C , C →A (C →B →A)
A →D , D →A(D →B →A)
B →C (B →A →C) , C →B
B →D(B → A →D) , D →B C B
C →D (C →B →A →D) , D →C(D →C)

Therefore, it is strongly connected.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 53

PROBLEM
A

iv)

𝐴 → 𝐵 𝐴 → C → 𝐵 ,B → A D
A →C , C →A (C →B →A)
A →D , D →A
B →C (B →A →C) , C →B C B
B →D , D →B
C →D , D →C
Therefore, it is unilaterally connected.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 54

EULER GRAPH
• In a digraph G, a closed directed walk which traverses every edge of G
exactly once is called a directed Euler line.

• Directed walk that starts and ends at the same vertex

• A digraph containing a directed Euler line is called

a Euler digraph

Euler line :
a →b →c →d →e →f

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 55

When is a digraph a Euler digraph?

• Digraph must be connected, with the possible exception of isolated

vertices; otherwise, every edge cannot be traversed in one walk

• A digraph G is a Euler digraph if and only if G is connected and is

balanced [i.e., d − (v) = d + (v) for every vertex v in G].

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 56

ADJACENCY MATRIX OF A DIGRAPH
• Let G be a digraph with “n” vertices containing no parallel edges, then the
adjacency matrix X = [xij] of the digraph G is a n by b, (0,1) matrix whose
element,

1, 𝑖𝑓 𝑡ℎ𝑒𝑟𝑒 𝑖𝑠 𝑎𝑛 𝑒𝑑𝑔𝑒 𝑑𝑖𝑟𝑒𝑐𝑡𝑒𝑑 𝑓𝑟𝑜𝑚 𝑡ℎ𝑒 𝑖𝑡ℎ 𝑣𝑒𝑟𝑡𝑒𝑥 𝑡𝑜 𝑗𝑡ℎ 𝑣𝑒𝑟𝑡𝑒𝑥

xij = ቊ
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

Adjacency matrix otherwise called as transition matrix, relation

matrix, connection matrix, precedence matrix or preference matrix,
predecessor matrix

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 57

ADJACENCY MATRIX OF A DIGRAPH

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 58

 observations
1. X is a symmetric matrix if and only if G is a symmetric digraph.
2. Every nonzero element on the main diagonal represents a self-loop at the corresponding vertex.
3. There is no way of showing parallel edges in X. This is why the adjacency matrix is defined only for a
digraph without parallel edges.
4. The sum of each row equals the out-degree of the corresponding vertex, and the sum of each column
equals the in-degree of the corresponding vertex. The number of nonzero entries in X equals the
number of edges in G.
5. Permutation of any two rows accompanied by a permutation of the corresponding columns does not
alter the graph. The permutation merely corresponds to a reordering of the vertices. Thus two digraphs
are isomorphic if and only if their adjacency matrices differ only by such permutations.
6. If X is the adjacency matrix of a digraph G, then the transposed matrix XT is the adjacency matrix of a
digraph GR obtained by reversing the direction of every edge in G. 7. For any square (0, l)-matrix Q of
order n, there exists a unique digraph G of n vertices, such that Q is the adjacency matrix of G.

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 59

 THANK YOU

DR.M.SUJITHRA , ASSISTANT PROFESSOR, DEPT OF COMPUTING- DATA SCIENCE 60