Abstract
The historical background of how graph theory emerged into world and gradually gained importance in different fields of study is very well stated in many books and articles. Some of the most important applications of graph theory can be seen in the field network theory. Its significance can be seen in some of the complex network systems in the field of biological system, ecological system, social systems as well as technological systems. In this paper, the basic concepts of graph theory in terms of network theory have been provided. The various network models like star network model, ring network model, and mesh network model have been presented along with their graphical representation. We have tried to establish the link between the models with the existing concepts in graph theory. Also, many application-based examples that links graph theory with network theory have been looked upon.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biswas J, Kayal P, Samanta D (2021) Reducing approximation error with rapid convergence rate for non-negative matrix factorization (NMF). Math Stat 9(3):285–289
Mukherjee M, Pal T, Samanta D (2012) Damaged paddy leaf detection using image processing. J Global Res Comput Sci 3(10):07–10
Dhanush V, Mahendra AR, Kumudavalli MV, Samanta D (2017) Application of deep learning technique for automatic data exchange with air-gapped systems and its security concerns. In: 2017 international conference on computing methodologies and communication (ICCMC). IEEE, pp 324–328
Gurunath R, Agarwal M, Nandi A, Samanta D (2018) An overview: security issue in iot network. In: 2018 2nd international conference on I-SMAC (IoT in social, mobile, analytics and cloud)(I-SMAC) I-SMAC (IoT in social, mobile, analytics and cloud)(I-SMAC), 2018 2nd international conference on. IEEE, pp 104–107
Sivakumar P, Nagaraju R, Samanta D, Sivaram M, Hindia MN, Amiri IS (2020) A novel free space communication system using nonlinear ingaasp microsystem resonators for enabling power-control toward smart cities. Wirel Netw 26(4):2317–2328
Guha A, Samanta D (2021) Hybrid approach to document anomaly detection: an application to facilitate rpa in title insurance. Int J Autom Comput 18(1):55–72
Biswal AK, Singh D, Pattanayak BK, Samanta D, Yang M-H (2021) Iot-based smart alert system for drowsy driver detection. Wirel Commun Mob Comput
Gomathy V, Padhy N, Samanta D, Sivaram M, Jain V, Amiri IS (2020) Malicious node detection using heterogeneous cluster based secure routing protocol (hcbs) in wireless adhoc sensor networks. J Ambient Intell Humanized Comput 11(11):4995–5001
Khamparia A, Singh PK, Rani P, Samanta D, Khanna A, Bhushan B (2021) An internet of health things-driven deep learning framework for detection and classification of skin cancer using transfer learning. Trans Emerg Telecommun Technol 32(7):e3963
Parsa K, Hassall M, Naderpour M (2021) Process alarm modeling using graph theory: alarm design review and rationalization. IEEE Syst J 15(2):2257–2268
Chen H, Soni U, Lu Y, Huroyan V, Maciejewski R, Kobourov S (2021) Same stats, different graphs: exploring the space of graphs in terms of graph properties. IEEE Trans Vis Comput Graph 27(3):2056–2072
Zhu Y, Yu W, Wen G, Chen G (2021) Distributed nash equilibrium seeking in an aggregative game on a directed graph. IEEE Trans Autom Control 66(6):2746–2753
Gao X, Dai W, Li C, Xiong H, Frossard P (2021) Multiscale representation learning of graph data with node affinity. IEEE Trans Signal Inf Process Over Netw 7:30–44
Jeon H-B, Koo B-H, Park S-H, Park J, Chae C-B (2021) Graph-theory-based resource allocation and mode selection in d2d communication systems: The role of full-duplex. IEEE Wirel Commun Lett 10(2):236–240
Ma H-J, Xu L-X (2021) Decentralized adaptive fault-tolerant control for a class of strong interconnected nonlinear systems via graph theory. IEEE Trans Autom Control 66(7):3227–3234
Zhang R, Yu Y, Liu H (2020) Burning Numbers of t-unicyclic Graphs. Bull Malays Math Sci Soc 45(1):417–430, Jan 2022
Barrus MD, Hartke SG, Jao KF, West DB (2012) Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps. Discret Math 312(9):1494–1501
Chen B-L, Yen C-H (2012) Equitable-coloring of graphs. Discret Math 312(9):1512–1517
Gyori E, Lemons N (2012) Hypergraphs with no cycle of length 4. Discret Math 312(9):1518–1520
Lai H-H, Lih K-W, Tsai P-Y (2012) The strong chromatic index of Halin graphs. Discret Math 312(9):1536–1541
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dahal, R., Samanta, D., Karuppiah, M., Biswas, J. (2023). Comparative Study of Graph Theory for Network System. In: Gupta, D., Khanna, A., Hassanien, A.E., Anand, S., Jaiswal, A. (eds) International Conference on Innovative Computing and Communications. Lecture Notes in Networks and Systems, vol 492. Springer, Singapore. https://doi.org/10.1007/978-981-19-3679-1_6
Download citation
DOI: https://doi.org/10.1007/978-981-19-3679-1_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-3678-4
Online ISBN: 978-981-19-3679-1
eBook Packages: EngineeringEngineering (R0)