Application of Graph Algorithm in Social Network
Megha Narayanan1, Sanil Shanker KP2
1Megha Narayanan, Department of Information Technology, Kannur University, Kerala, India.
2Sanil Shanker KP, Department of Computer Science, Government College Thalassery, Kerala, India.
Manuscript received on 13 August 2019. | Revised Manuscript received on 19 August 2019. | Manuscript published on 30 September 2019. | PP: 7705-7707 | Volume-8 Issue-3 September 2019 | Retrieval Number: C6260098319/2019©BEIESP | DOI: 10.35940/ijrte.C6260.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Adjacency Matrix, Breadth First Search, Depth First Search, Graph Algorithm, Node Link Diagram, Social Network
Scope of the Article: Social Networks