Graph Terminologies

By

Junaid Ali Siddiqui

 Topic of presentation
graph terminologies
Definition
A graph is a non linear data structure
which is made up set of nodes and lines
Here nodes are called vertices or points
and lines are called edges
Edges are used to connect vertices
Suppose a graph e=[a b] e is edge and
a b are nodes
 Now Terminologies
1.Degree of anode
Two types
Out degree
In degree

2.Source and sink

3.Pendent node
4.Loop edge
5.Multiple edge
6.Path
Path has four types .1 simple path 2 closed path 3 cyclic 4 acyclic
7.Lenth
 DEGREE OF A NODE
The no of edges that a node contains is
called the degree of a node.
suppose graph

A C

B D
In above fig nodes having degree
A has degree 3
B has degree 2
C has degree 2
D has degree 3
A node have 0 degree is called isolated node
While a graph having only one isolated node is
called null graph.
 Degree has two types
1.out degree
The no of edges beginning from a node is called out
degree
In following graph .A has 3 out degree.C has 1 and d also
1 out degree.and b has 0 out degree.
A node have zero out degree is called terminal node.
While other nodes are called branches
-
2.in degree
the no of the edges ending at a node is called
indegree
In following graph
A has in degree 0
B has in degree 2
C has in degree 1
D has indegree 2
As the sum of in degree and out degree is called
total degree
Graph for in and out degree is

A C

B D
 2.Source and sink
Source
The node that has a positive out degree but ‘0’ in degree
is called source.
In given graph A is a source node b/c it has 3 out
positive degree and ‘0’ in degree is called source
Sink
The node that has ‘0’ out degree but have positive in
degree is called sink
In given graph .B is a sink node b/c it has ‘0’ out degree
and 2 in degree
Graph of source and sink

C
A

B D
 3.Pendent node-
A node is said to be a pendent node if its
total degree equal 1.
In given graph A is a pendent node b/c it
has 1 ,out degree and ‘0’ in degree so its
total degree is 1 .
B
Fig C

E
D
 4.Loop edge
An edge is said to be a loop edge if the
same node is tail and head
A loop edge is shown in graph

C
 5.Multiple edges

A graph is said to have multiple edges if

it has more than one edge have the same
tail and head nodes
A graph of multiple edges is shown below

C
 6.Path of a graph
A list of nodes of a graph where each
node has edge from it to the next node is
called the path
In general no of nodes are
U1,u2,u3………un .
 Path has four types
1.simple path
A path which have no repeated nodes is
called simple path
e.g. u1,u2,u3…….un
u2
u1

un
.u3
 2.Closed path
A path that has nodes u1=un is called
closed path
As shown in figure

u1 u2

u3
un
 3. cyclic path
A path which starts and ends at the same
node is called cyclic path
OR a path from a node to itself is called
cyclic path
the lenth of a cyclic path must be one
e.g.
A B

C D
 4. A cyclic path
A path that has no cycle is called a cyclic
path
As shown in graph
A B

D
C

E
 Length of graph
The no of edges in a path of a graph is
called length of a graph.
As length in a path of a graph is given
Length=node -1
L= 3-1=2
A B

C D
QUESTION….???????
 MESSAGE
A main is known by the
company he keep
So Always be honest
and good