Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks

Abdul Majeed,Ibtisam Rauf

doi:10.3390/inventions5010010

Abstract

Graph theory (GT) concepts are potentially applicable in the field of computer science (CS) for many purposes. The unique applications of GT in the CS field such as clustering of web documents, cryptography, and analyzing an algorithm’s execution, among others, are promising applications. Furthermore, GT concepts can be employed to electronic circuit simplifications and analysis. Recently, graphs have been extensively used in social networks (SNs) for many purposes related to modelling and analysis of the SN structures, SN operation modelling, SN user analysis, and many other related aspects. Considering the widespread applications of GT in SNs, this article comprehensively summarizes GT use in the SNs. The goal of this survey paper is twofold. First, we briefly discuss the potential applications of GT in the CS field along with practical examples. Second, we explain the GT uses in the SNs with sufficient concepts and examples to demonstrate the significance of graphs in SN modeling and analysis.

Highlights

We found that graph theory (GT) concepts are fundamental in social networks (SNs) analysis and modelling
Organization domains; and (vi) to the best of our knowledge, is the first survey that covers use in both it covers many realistic examples from both in which the graphs were increasingly from the research community; (v) it provides the visual examples with sufficient details that can (i) it explains the relevant details about the graph theory concept, different types of the graphs, (3)
Software developers make the complete design of their applications prior to conclusions and future directions area presented in aworks

Summary

Introduction

The concept/origin of graph theory (GT) started with the Koinsber Bridge’s problem in 1735 for the first time in history [1]. With the help of the Koinsber Bridge’s problem, the concept of the Eulerian graph was derived. Euler studied the concept of the Koinsber Bridge’s problem, and devised a new structure which was named the Eulerian Graph. A.F Mobius gave the concept of two graphs i.e., complete graph and bipartite graph, in 1840 [2]. Kuratowski used both these graphs in some recreational problems and proved that both these graphs are planar in the recreational problems domain [3]. A survey of graph-modification techniques for privacy-preserving on networks

Objectives

Discussion

Conclusion