Application of graph algorithm in social network

Citations of this article
Mendeley users who have this article in their library.
Get full text


Graphs are mathematical structures used to study associations between objects and entities. Graph theory can be used to study and model social networks. The prime graph theoretic problems twig with shortest path problem, topological sort of the graph and spanning tree. The social network analysis is an interdisciplinary area to recognize the composition of the relationships between social units such as an individual, family and cluster. Ubiquitous social network applications unified with computation can be nimble fingered adroitly with graph structures. Graphs offer an intuitively visual way of thinking about the concepts of relationship found in social network analysis. Operations like insertion, deletion, traversal and merging can be substantiated with the representation of graph. This paper explores how social network can be palpable with the existing algorithms which squeezed graph theoretical concepts.




Narayanan, M., & Sanil Shanker, K. P. (2019). Application of graph algorithm in social network. International Journal of Recent Technology and Engineering, 8(3), 7705–7707.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free