Characteristics of nerve graph: A view from graph terminologies
DOI:
https://doi.org/10.15282/daam.v6i1.12073Keywords:
Graph theory, Nerve graph, Simple graph, Degree, Bipartite, AdjacentAbstract
In this study, the characteristics of nerve graph are investigated through graph theory. This study addresses the problem of identifying and characterizing nerve graph from the perspective of simple, degree, bipartite, adjacency and cycles terminologies. Employing the proof-by-cases method, this article systematically analyses the characteristics of the nerve graph and reveals distinct features based on its structural configurations. This research significantly contributes to graph theory field by enhancing the understanding of nerve graph and paving the way for further research and practical applications.
References
[1] West DB. Introduction to graph theory. Upper Saddle River: Prentice hall; 2001 Sep.
[2] Dandashi A, Al-Mouhamed M. Graph coloring for class scheduling. In ACS/IEEE International Conference on Computer Systems and Applications-AICCSA 2010. 2010 (pp. 1-4). IEEE.
[3] Hanafi NM, Yusof Y, Mohamad MS, Bakar MF, Ibrahim MA. Medicinal cupping in the eyes of graph theory. Data Analytics and Applied Mathematics (DAAM). 2020:44-9.
[4] Wang H. Network graph theory and organization model analysis based on mathematical modeling with the dynamic systematic data perspective. In 2022 6th International Conference on Trends in Electronics and Informatics (ICOEI) 2022 (pp. 915-919). IEEE.
[5] Rosen, Kenneth H., and Kamala Krithivasan. Discrete mathematics and its applications. Vol. 6. New York: McGraw-Hill, 1999.
[6] Erdöus P. Problems and results in combinatorial analysis and graph theory. In Annals of discrete mathematics 1988 (vol. 38, pp. 81-92). Elsevier.
[7] Deo N. Graph theory with applications to engineering and computer science. Courier Dover Publications; 2016.
[8] Petrosyan P, Khachatrian H, Mamikonyan T. On interval edge-colorings of bipartite graphs. In 2015 Computer Science and Information Technologies (CSIT) 2015 (pp. 71-76). IEEE.
[9] Van Steen M. Graph theory and complex networks. An introduction. 2010;144(1).
[10] Chimani M, Hliněný P. Inserting multiple edges into a planar graph. arXiv preprint arXiv:1509.07952. 2015.
[11] Hanafi NM, Yusof Y, Mohamad MS, Bakar MF, Ibrahim MA. A preliminary study of optimizing back pain medicinal cupping points disease via graph colouring. In Journal of Physics: Conference Series 2019 (vol. 1366, no. 1, p. 012077). IOP Publishing.
[12] Zhang P, Chartrand G. Introduction to graph theory. New York: Tata McGraw-Hill; 2006.
[13] Harary F. Graph theory (on Demand Printing of 02787). CRC Press; 2018 Mar 5.
[14] Mohar B, Thomassen C. Graphs on surfaces. Johns Hopkins University Press; 2001.
[15] Bollobás B. Modern graph theory. Springer Science & Business Media; 1998.
[16] Erdos P, Simonovits M. A limit theorem in graph theory. Studies Scientiarum Mattiematiearum Hungariea 1966;1(51-57).
[17] Wilson, Robin J. Introduction to graph theory. Pearson Education India, 1979.
[18] Guichard D. An introduction to combinatorics and graph theory. Whitman College-Creative Commons. 2017.
[19] Aziz NA, Yusof Y, Radzuan HM, Noviantri V. Optimizing diabetes cupping point from graph colouring perspective. Journal of Advanced Research in Applied Sciences and Engineering Technology. 2024;48(1):205-212.
[20] Koh KM, Dong FM, Tay EG. Graphs and their applications (3). Mathematical Medley. 2003;30(1):11-22.
[21] Van Dooren P. Graph theory and applications. Université Catholique de Louvain, Belgium. Dublin. 2009.
[22] Bondy JA, Murty US. Graph theory with applications. London: Macmillan; 1976.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 The Author(s)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
