See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/328954103

Application of Graph Theory in Social Media

Article in INTERNATIONAL JOURNAL OF COMPUTER SCIENCES AND ENGINEERING · October 2018

DOI: 10.26438/ijcse/v6i10.722729

CITATIONS READS
22 37,903

4 authors, including:

Anwesha Chakraborty Trina Dutta

St. Xavier's College, Kolkata St. Xavier's College, Kolkata
4 PUBLICATIONS 38 CITATIONS 3 PUBLICATIONS 38 CITATIONS

SEE PROFILE SEE PROFILE

Asoke Nath
St. Xavier's College, Kolkata
278 PUBLICATIONS 2,200 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Hash and Salt based Steganographic Approach with Modified LSB Encoding View project

Detection of Different Stages of Lungs Cancer in CT-Scan Images using Image Processing Techniques View project

All content following this page was uploaded by Asoke Nath on 15 November 2018.

The user has requested enhancement of the downloaded file.

 International Journal of Computer Sciences and Engineering Open Access
Research Paper Vol.-6, Issue-10, Oct 2018 E-ISSN: 2347-2693

Application of Graph Theory in Social Media

Anwesha Chakraborty1*, Trina Dutta2, Sushmita Mondal3, Asoke Nath4

1,2,3,4
Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India
*
Corresponding Author: [email protected]

Available online at www.ijcseonline.org

Accepted: 22/Oct/2018, Published: 31/Oct/2018

Abstract— A graph is made up of nodes; just like that a social media is a kind of a social network, where each person or
organization represents a node. These nodes in a social media are interdependent on each other via common interests, relations,
mutual friends, knowledge, common dislikes, beliefs etc. The overall graphical structure of a social media can be very complex
with millions of nodes and thousands of interconnections amongst them based upon various grounds. Many researchers have
revealed that social network works on various levels and helps in understanding many things such as how an entire
organization is run. It helps to solve and understand many critical problems.

The analysis of the social media is a very useful tool for extracting knowledge from unstructured data. The knowledge obtained
from this field provides a vivid knowledge of various kinds interactions and relations amongst various individuals on social
media. The authors have elaborated on the various applications of graph theory on social media and how it is represented viz.
strong and weak ties. [1]

Keywords— Graph, Nodes, Social Media, Graphical structure, Unstructures data, Strong and Weak ties.
i. Adjacency matrices.
I. INTRODUCTION ii. Adjacency lists.

What is a graph? i. Adjacency Matrices: Here the graph is

A graph represents a network which consists of a set of represented as an n X n square matrix; M. n
objects, mathematically called vertices or nodes. These represents the number of vertices present in the
vertices or nodes are interconnected with each other based graph.
upon some relation, with the help of nodes or arcs. [2]
Graph can be of two types based upon the type of edges: If Mij = 1, it means there is an edge connecting
i. Directed Edges: Here the arcs between two vertices vertex i and vertex j and if M ij = 0, it means there
have a particular direction; they are directed from one is no edge connecting vertex i and vertex j. Let us
vertex to another. It is usually represented by an arrow. consider the following 6x6 matrix:
ii. Undirected Edges: Here the edges do not have any
particular direction from one vertex to another; there is
no difference between the two vertices connected via 1 5 6
one undirected edge. It is usually represented by a
straight line.

A graph can again be classified based upon the presence or

absence of cycles formed in the graph:
i. Cyclic Graph: If a cycle is formed in a graph then it is
called a cyclic graph. It is a closed figure which starts 2
and ends with the same vertex. 4
ii. Acyclic Graph: If the graph forms no cycle then it is
called an acyclic graph. [3]

Representation of graphs 3
A graph can be represented mainly as two ways:

© 2018, IJCSE All Rights Reserved 722

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

reduced. But the complexity in computation increases in

this case. [3]
1 2 3 4 5 6
1 0 1 0 0 1 0 This paper concentrates the application and implications of
2 1 0 1 0 1 0 graph theory on social media, social network analysis,
3 0 1 0 1 0 0 interpersonal ties, triadic closure, bridges, and properties of
4 0 0 1 0 1 1 social network. It also includes a case study of few
Facebook users, graph partitioning required for structural
5 1 1 0 1 0 0
analysis of social media.
6 0 0 0 1 0 0
II. GRAPH THEORY AND SOCIAL MEDIA:
Figure 1: Adjacency Matrix and its corresponding graph.
The concept of graph theory is extensively used in social
Although the computation process in adjacency matrix is media. Usually here the users or the people involved are
quite simple but it contains lots of zeroes and wastes a lots considered as the nodes or vertices. And any relation
of space. In adjacency list representation of graphs, this between the users due to common likes or mutual
disadvantage has been eliminated. friendship is considered as edges.
Adjacency list: In this case, all the zeroes of the adjacency
matrix are eliminated and only the corresponding  Graph Theory in Facebook: Majority are familiar with
neighboring nodes of a particular node are considered. Facebook these days. You can click ‘like’ if you find
1 2 3 4 5 6 something likeable, ‘tag’ your friends in various ‘posts’,
1 0 1 0 0 1 0 put comments in posts and most importantly befriend
2 1 0 1 0 1 0 someone whom you know and also someone whom you
3 0 1 0 1 0 0 don’t know! The concept of graph theory is used in
0 0 1 0 1 1 Facebook with each person as nodes and every like,
4
share, comment, tag as edges.
5 1 1 0 1 0 0
6 0 0 0 1 0 0
 Graph Theory in Twitter: Here the persons are
considered as nodes and if one person follows another
then that is considered as the edge between the two
Neighboring nodes of 1: 2, 5.
Neighboring nodes of 2: 1, 3, and 5. III. OTHER APPLICATIONS OF GRAPH THEORY IN
Neighboring nodes of 3: 2, 4. VARIOUS FIELDS: [2]
Neighboring nodes of 4: 3, 5, and 6.
Neighboring nodes of 5: 1, 2, and 4.  Geometrical and other mathematical studies: If we do
Neighboring nodes of 6: 4. not consider the length of the edge and vertical angles of
a polygon, then it can be safely assumed as a graph with
its vertices and edges. This fact might not be that useful
in the study of polygons but this theory is widely used
1 5 6 in the study of surfaces and objects with higher
dimension. Graph is also used in algebra.

 Electrical engineering: Kirchhoff used the concept of

graph to understand electrical circuits in the late 1850s
and it has been a part of electrical engineering ever
2
since.
4
 Designing transportation networks: Architects and
planners use the concept of graph before building
3
highways and bridges. They consider the various cities
as nodes and the highway connecting them as edges. It
is also used locally inside the cities as well e.g. while
Figure2: Adjacency list and its corresponding matrix
constructing a bus stop. Here the bus stops acts as nodes
and the roads connecting them are edges. Here the
Here, in adjacency list, all the zeroes of the adjacency
distance between the bus stops i.e. weights or values of
matrix are eliminated and the wastage of space is also being

© 2018, IJCSE All Rights Reserved 723

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

the edges are considered because that will indicate the Brief idea on Social Network
time taken to traverse the distance. When we need to represent any form of relations in the
 Communication networks: A computer network whether society in the form of links, it can be termed as Social
centralized or distributed forms a graph. The internet Network. The pattern of interdependency between each
routing system and other data and packet routing individual (node) can be based on different aspects, viz. -
systems in a computer network represents a graphical friendship, interconnection between families, common
structure with the various computers or devices as nodes interest, financial exchange, dislike, sexual relationships, or
and the routing path between them as edges. relationships of beliefs, knowledge or prestige.
 The World Wide Web: The World Wide Web also
represents a huge graph. Various pages in the web is
considered as nodes and if there is any hyperlink
between two pages then that is the edge between those
two pages.

IV. SOCIAL NETWORK

To begin with, we need to have some idea about Network.

There are several ways of formally defining a network,
depending on the branch of mathematics used. The most
usual and flexible definition is derived from graph theory, a
social network is conceptualized as a graph, that is, a set of
vertices (or nodes, units, points) representing social entities
or objects and a set of lines representing one or more social
relations among them. A network, however, is more than a
graph because it contains additional information on the Figure 3: Network of friends
vertices and lines
Figure 3 shows the relationship of a particular group of
Formally, a network N can be defined as N = (U, L, F U, FL) school friends. Each vertex represents a key person in the
containing a graph G = (U, L), which is an ordered pair of a friendship, and the edges denote a connection by
unit or vertex set U and a line set L, extended with a relationship and interaction of any kind that has been
function FU specifying a vector of properties of the units (f: denoted by four different colors.
U → X) and a function FL specifying a vector of properties
of the lines (f: L → Y). The set of lines L may be regarded V. SOCIAL NETWORK ANALYSIS
as the union of a set of undirected edges E and a set of
directed arcs A (L E ∪= A). Each element e of E (each Just like with classical graph theory, there are many points
edge) is an unordered pair of units u and v (vertices) from of view from which one can enter the study of social
U, that is, e(u: v), and each element a of A (each arc) is an networks. One might come to social networks as a
ordered pair of units u and v (vertices) from U , that is, a(u: sociologist, or anthropologist, or linguist, or economist, or
v). [4] computer scientist, or engineer, or biologist, or
Based on the contents of the nodes Network can be divided businessperson, or investigator.
into two major types:
 Social and Economic Network – It consists of a group The notion of characterizing social networks by key
of people connected with some sort of interactions or properties is important when it comes to the question of
pattern of communication. modeling social networks. By modeling social networks,
e.g. - Facebook, Twitter, business relation between we mean finding an algorithmic way to generate graphs
companies and clients, interrelationship between whose key properties are essentially the same as those of
families involved in a marriage etc. social networks found in nature. These methods typically
 Information Network -The connection between depend upon a random process- maybe at each stage you
information objects add/remove a node or edge with some given probability.
e.g. – Semantic (links between various words and People have used the idea of "social network" loosely for
symbols), World Wide Web (link between various web over a century to connote complex sets of relationships
pages; new page connecting to another through between members of social systems at all scales, from
hyperlinks) [5] interpersonal to international. In 1954, J. A. Barnes started
Here, we are going to concentrate only on Social Network using the term systematically to denote patterns of ties,
and the working principle of Graph Theory on it. encompassing concepts traditionally used by the public and

© 2018, IJCSE All Rights Reserved 724

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

those used by social scientists: bounded groups (e.g., tribes, In “The Strength of weak ties” Granovetter talks about ties
families) and social categories (e.g., gender, ethnicity). [6] and their role in social networks. He defines the strength of
Overall and Local Network Structure – These are the two a tie as a combination of services, the amount of time, the
perspective to analyze social networks. Overall Network intimacy, and the emotional intensity between the subjects
structure concentrates on ties and interaction between (Granovetter, 1973). He also talks about the possibility of
persons or other social objects. This approach to social forming new acquaintances when two persons have a
networks is known as the socio-centered approach. The strong connection to a third person, i.e. triadic closure.
other approach to social networks focuses on the individual [9]Triadic Closure is a principle that implies that if two
element and its immediate network neighborhood and is friends in social network have a friend in common, then
analyzed through Local Network structure. This is known there is increased likelihood that they will become friends
as the ego-centered approach. too. A triad is a group of three entities and triadic closure is
the solution to the problem of how an open triad becomes a
In order to explain and analyze networks, we need to focus close triad.
on the following topics:

 Interpersonal ties
 Triadic Closure
 Bridges
In mathematical sociology, interpersonal ties define the
type of connection between two or more people in a
relationship. These ties are important and relevant in social Figure 4: Open triad and close triad
network interactions and can be classified into 3 different
type based on the strength of interaction: strong ties, weak Weak ties play a crucial role in binding a group of strong
ties and absent ties. ties together. They help in strengthening the relationship
and forming new bonds between existing relations. So,
 Strong ties: the stronger links, corresponding weak ties can operate as bridges between two groups. To
to friends, dependable sources of social or fully understand what this means, one first have to
emotional support. understand the term bridge. A link between two nodes A
 Weak ties: the weaker links, corresponding and B is a bridge if deleting this link separates the nodes
to acquaintances. into two components. The bridge is the only way
 Absent ties: the one for which we have no information can move from A to B. There are two types of
information regarding its nature. bridges- local bridge and a regular bridge.

American Sociologist Mark Granovetter refers to your A local bridge is a link between two nodes which when
strong ties as your friends and your weak ties as your broken increases the distance between those nodes to more
acquaintances in his paper "Notes on the strength of than two. It’s the shortest route through which information
weak ties" Mark talks about the interpersonal can flow from a group of nodes to another group. Based on
relationships between different, disparate groups of the definition of strong triadic closure*, a local bridge is
people and how they hold different sections of society necessarily a weak tie.
together. [7]
The occurrence of a bridge in large social networks is rare
Tie Strength in Large-Scale Data- Tie strength refers to a due to the fact that in most cases there will be a different
general sense of closeness with another person. Refer to the path that connects the nodes A and B together. Local
Figure 3, we extend the strong and weak ties as in a bridges however are more often seen and can connect us
continuous quantity to measure the Neighborhood Overlap with parts of the network that would otherwise been
(NO) of an edge (x,y). neglected. [9]

NO(x, y) = {*The Strong Triadic Closure Property–It is the property

among three nodes A, B and C, such that if a strong tie
exits between A-B and A-C, there is a weak or strong tie
between B-C.}
=

For example, NO(A, B) = 0, and NO(A, F) = from

Figure 3.[8]

© 2018, IJCSE All Rights Reserved 725

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

Small networks can be visualized by their graphs but larger

networks can be difficult to be analyzed. Therefore, we
define a set of summary statistics or quantitative
performance measures to describe and compare networks
(focus on undirected graphs):

o Size
o Density
o Planer Network Density
o Connectedness
o Diameter and average path length
o Clustering
o Centrality
Figure 5: Strong ties, Weak ties, Local bridges o Degree distributions

Each edge of the social network is labeled either a strong Here we will explain some of the characteristics:
tie or weak tie to indicate the strength of a relationship.
Local bridges are especially those with large span.  Diameter and average path length-Let I (i, j)
Regarding absent ties, Rosenfeld and Thomas (2012) argue denote the length of the shortest path (or geodesic)
that “the Internet increasingly allows Americans to meet between node i and j (or the distance between i
and form relationships with perfect strangers, that is, people and j). The diameter of a network is the largest
with whom they had no previous social tie”. [10] distance between any two nodes in the network:
Diameter= max I (i, j)
Structural holes were first developed by Ronald Stuart The average path length is the average distance between
Burt in 1992. It is concept from social network. It is a gap any two nodes in the network:
between two individuals who have complementary sources
to information. It spans the fields of sociology, economics, Average path length =
and computer science. [11]Structural hole is lack of
connection between two nodes that is bridged by a broker.

 Average path length is bounded from above by the

diameter; in some cases, it can be much shorter
than the diameter.
 If the network is not connected, one often checks
the diameter and the average path length in the
largest component.

 Clustering-We can measure the strength of triadic

closure via the clustering coefficient. This
Figure 6: Structural Hole clustering measure is represented by the overall
clustering coefficient Cl(g), given by
VI. PROPERTIES OF NETWORK

Euler unintentionally showed that networks have Cl(g)=

properties, which is dependent on their topological
architecture that limit or enhance their usability. Network Where a “connected triple" refers to a node with
analysis studies properties at three levels of abstraction: edges to an unordered pair of nodes.
 Element-level analysis, where methods to identify the Note that 0 ≤ Cl(g) ≤ 1.
most important nodes of the network are investigated,
 Group-level analysis, that involves methods for Cl(g) measures the fraction of triples that have
defining and finding cohesive groups of nodes in the their third edge filled in to complete the triangle.
network, and Another measure of clustering is
 Network-level analysis, that focuses on topological defined on an individual node basis:
properties of networks as a whole. [12] The individual clustering for a node i is

© 2018, IJCSE All Rights Reserved 726

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

VIII. EXAMPLE OF CASE STUDY: MEASURING

Cli(g) = NETWORKS ON FACEBOOK [13]

This case study depicts the size of Facebook networks. Few

Avg random users have been studies for the course of a month
The average clustering coefficient is Cl (g) =
and the relationship is classified into four different network
∑iCli(g) patterns:
 Centrality- A micro measure that captures the
importance of a node's position in the network. All Friends: This network represents the list of all friends a
Different measures of centrality: user has, hence this is the largest among all the
 Degree centrality: for node i , representations
di (g)/n ─ 1, where di (g) is the degree of
node i Reciprocal Communication: This representation shows
the mutual communication between two parties, this type of
Closeness centrality: Tracks how close a network forms when there is mutual exchange of
given node is to any other node: for node information between two parties.
i , one such measure is
One-way Communication: It consists of people with
, where l (i,j) is the distance between i and j whom a user has communicated.

Maintained Relationships: This pattern of relationship

Betweenness centrality: Captures how well consists of people whose profile has been checked by the
situated a node is in terms of paths that it lies user more than once to maintain engagement.
on.
Centralization is the corresponding structural property of
the overall network and it is defined as the variation in the
centrality scores of the vertices in the network because this
variation shows the extent to which there is a center (very
central vertices) and a periphery (vertices with very low
centrality scores). The star and ring networks are defined as
respectively the most and least centralized networks
(centralization scores of 1 and 0).

 Degree distributions- The degree distribution,

P(d), of a network is a description of relative
frequencies of nodes that have different degrees d.
o For a given graph: P(d) is a histogram,
i.e., P(d) is the fraction of nodes with
degree d.
o For a random graph model: P(d) is a
probability distribution. [5]

VII. NETWORK MODELS

Network models can be classified based on two factors:

1. Topology- Some common models are: Figure 7: Network patterns of a user on Facebook
Random graph
Erdős–Rényi In the diagram, the red line shows the number of reciprocal
Barabási–Albert relationships, the green line shows the one-way
Fitness model relationships, and the blue line shows the passive
2. Dynamics- Known models are given relationships is a function of your network size.
below
Boolean Network
Agent Based
Epidemic/SIR

© 2018, IJCSE All Rights Reserved 727

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

Multi-level partitioning is highly effective than the classical

graph partitioning methods. Constrained graph partitioning
problems are efficiently solved by this method. The main
idea is to partition the large graphs into k – parts, group the
vertices together in a group and deal with this group of
vertices rather than independent vertices. It has three phases
– coarsening phase, initial partitioning phase, and partition
refinement phase. [14]

X. STRUCTURAL ANALYSIS

Graph is a mathematical structure which shows relation

between some objects. Graph is made up of vertices, nodes,
or points which are connected using lines, arcs or edges. A
graph may directed or undirected. A graph represented as
G= (V, E) where V is set of vertices and E is set of edges.
Graph is represented using different data structures like
Figure 8: Graphical representation adjacency list, adjacency matrices, incidence matrices etc.

IX. GRAPH PARTITIONING In a social network the node represent individuals or

organizations and the edges represent the relationship
Graphs are also used by various scientists or researchers for between individuals or organizations. Social network
modeling an application program. Partitioning a graph is provides set of methods for analyzing the structure of
purely an algorithmic problem. It helps to reduce whole social entities. There are different levels of analysis
complexity of big graphs and also introduces that are not necessarily mutually exclusive. Generally there
parallelization. Graph partitioning is required in various are three levels:
application problems like social networks, road networks,  Micro level- At this level it typically begins with
air traffic controls, image analysis etc. Some applications of an individual or may begin with a small group of
graph portioning problems are scientific computing, individuals.
partitioning various stages of VLSI design circuit, task  Meso level- It falls between micro and macro-
scheduling in multiprocessor systems etc. The aim of graph level. It shows the connection between the micro
partitioning is to divide the nodes into several disjoint parts and macro level. Meso-level networks are low
such that the predefined objective function is minimal. The density network.
optimal graph partitioning is NP-complete however various  Macro level- These are large scale networks that
approximate algorithms are made to solve the problems. traces the interactions over large population. These
Graph partitioning is divided into two groups – networks are more complex.
i) Constrained Partitioning- In this partitioning the
parts are of equal size. XI. CONCLUSION
ii) Unconstrained Partitioning- In this portioning
the parts are of different size. In this paper we have discussed about the various aspects of
Various algorithms were developed for graph partitioning. graphs and its basic properties. Graphs are used in social
Among them three principle algorithms are Geometric networks whose complexity is increasing with the
partitioning, Spectral partitioning and Multi-level graph advancement in social media. Researchers are still
partitioning. [14] developing various algorithms for better understanding of
social networks and for partitioning the graphs to reduce its
In Geometric partitioning the graph is bisected by utilizing complexity and for better understanding of networks.
those coordinates which are obtained if nodes of a graph
are available in space. In this partition the vertices which REFERENCES
are spatially near to each other are taken into one cluster.
In Spectral partitioning the associability of the graph is [1]. Marcin Mince, Ewa Niewiadomska-Szynkiewicz, “Application
concluded by finding the Eigen vectors with respect to the of Social Network Analysis to the Investigation of Interpersonal
second smallest Eigen value of Laplacian matrix L Connections”, February 2012.
corresponding to graph. This bisection method is really [2]. Kimball Martin, “Graph Theory and Social Networks”, April 30,
demanding but not feasible for large graphs. 2014.
[3]. Alexandru Costan, “Graph Theory and Social Networks”,

© 2018, IJCSE All Rights Reserved 728

 International Journal of Computer Sciences and Engineering Vol.6(10), Oct 2018, E-ISSN: 2347-2693

[4]. 4.https://www.uva.nl/binaries/content/documents/personalpages/
n/o/w.denooy/en/tab-one/tab-
one/cpitem%5B26%5D/asset?1355372751494.
[5]. Daron Acemoglu and Asu Ozdaglar, “Networks, Lecture 2:
Graph Theory and Social Networks”, September 14, 2009.
[6]. Jayson Rome, “Graph Triangulation”, October 14, 2002.
[7]. Eileen Brown, “SOCIAL MEDIA TODAY: Strong and Weak
Ties: Why Your Weak Ties Matter”, June 30, 2011.
[8]. Donglei Du, “Strength of weak ties paradox”.
[9]. Sosial nettverksteori in blog tilhorende kurset INFO207/INF207
pa Universitetet i Bergen, innlegg skrevet av studentene med’
[10]. Josu´e Ortega, Philipp Hergovich, “The Strength of Absent Ties:
Social Integration via Online Dating”, October 2, 2017.
[11]. https://www.semanticscholar.org/topic/Structural-holes/448117
[12]. 12.https://users.dimi.uniud.it/~massimo.franceschet/networks/ne
xus/properties.html
[13]. Cameron Marlow, Lee Byron, Tom Lento, Itamar Rosenn,
“Maintained relationships on Facebook”, 2009.
[14]. Tieyun Qian1, Yang Yang2, Shuo Wang2, “Refining Graph
partitioning for Social Network Clustering”,2010.

Authors Profile
Anwesha Chakraborty is currently pursuing
M.Sc. in Computer Science (2017-2019) from St.
Xavier’s College (Autonomous) Kolkata. She
has received her B.Sc. degree in Computer
Science in 2017 from the same college. Her final
year project on B.Sc. was based upon Virtual
Classroom, a web based project. She has also
done a review paper on Li-Fi, Big Data Analytics and on Java,
defining it with the help of Finite state automation.

Trina Dutta is currently pursuing M.Sc. in

Computer Science (2017-2019) from St.
Xavier’s College (Autonomous) Kolkata. She
has received her B.Sc. degree in Computer
Science in 2017 from the same college. Her
final year project on B.Sc. was based upon
Virtual Classroom, a web based project. She
has also done a review paper on Li-Fi, and on Big Data Analytics.

Sushmita Mondal is currently pursuing M.Sc. in

Computer Science (2017-2019) from St.
Xavier’s College (Autonomous) Kolkata. She
has received her B.Sc. degree in Computer
Science in 2017 from the same college. Her final
year project on B.Sc. was based upon Virtual
Classroom, a web based project. She has also
done a review paper on Li-Fi, and on Big Data Analytics.

Dr. Asoke Nath is working as lecturer in the

Department of Computer Science, St. Xavier’s
College (Autonomous), Kolkata. He is engaged
in research work in the field of Cryptography
and Network Security, Steganography, Green
Computing, Big data analytics, Li-Fi
Technology, Mathematical modelling of Social
Area Networks, MOOCs etc. He has published more than 232
research articles in different Journals and conference proceedings

© 2018, IJCSE All Rights Reserved 729

View publication stats