GRAPH LABELING AS A USEFUL MODEL FOR A WIDE VARIETY OF APPLICATIONS
DOI:
https://doi.org/10.61841/rsy0xx93Keywords:
Graph Labeling, Problems, Graph theory, applications, mathematicsAbstract
We may all be familiar with graphs and their relevance. In recent years, graph labelling has become equally important. The current research focuses on several graph labelling applications. Alexander Rosa was the first to present graph labelling in the 1960s. Currently, a variety of graph labelling strategies exist, and a vast amount of literature on various graph labelling challenges is available in both printed and electronic form. Graph theory is linked to a variety of fields of mathematics and sociology, including discrete mathematics, network theory, information framework, and interpersonal organisation research. In graph theory, there are various exciting areas of study. The labelling of graphs is one of these areas that cuts across a wide range of applications
Downloads
References
1. L. Pandiselvi, S. NavaneethaKrishnan and A. NellaiMurugan, Path Related V4
Cordial Graphs.International Journal Of Recent Advances in Multidisciplinary
Research, Vol. 03, Issue 02, pp. 1285-1294, February 2016.
2. A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs
(International Symposium, Rome), July (1966).
3. C. Sekar, Studies in Graph Theory, Ph.D. Thesis, Madurai Kamaraj University,
2002. R. Sridevi, S. Navaneethakrishnan and K. Nagarajan, Odd-Even graceful
graphs, J. Appl. Math. & Informatics Vol. 30 (2012), No. 5-6, pp. 913-923.
4. M. Sundaram, R. Ponraj and S. SomasundaramPrime Cordial Labeling of graphs,
Journal of Indian Academy of Mathematics, 27 (2005), 373-390.
5. R. Sridevi, A. NellaiMurugan, A. Nagarajan, and S.
NavaneethakrishnanFibonacci Divisor Cordial Graphs, International Journal of
Mathematics and Soft Computing.
6. R. Sridevi, S. NavaneethakrishnanSome New Graph Labeling Problems and
Related Topics(Thesis). ManonmaniamSundaranar University, January 2013.
Solomon W. Golombo, How to number a graph, Graph Theory and Computing,
Academic Press, New York (1972), 23-37.
7. R. Tao, On k-cordiality of cycles, crowns and wheels, Systems Sci., 11 (1998),
227-229. R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, Special
classes of Divisor Cordial graphs, International Mathematical Forum, vol. 7,
2012, no. 35, 1737-1749.
8. R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, Divisor cordial
graph, International Journal of Mathematical Comb., Vol. 4(2011), 15-25.
9. S.K. Vaidya, U.M. PrajapatiFibonacci and Super Fibonacci Graceful Labelings
of some cycle-related graphs, International J. Math. Combi., Vol. 4, (2011), 59-69.
10. R. Vasuki, A. Nagarajan Studies in Graph Theory: Labeling Problems in
Graphs (Thesis), Manonmaniam Sundaranar University, December 2010. M.Z.
Youssef, On k-cordial labeling, Australas J. Combin., Vol 43 (2009), 31-37.
11. G.J. Gallian, A Dynamic survey of graph labeling, The electronic journal of
combinotorics, 16 (2009), #DS6. Z. Gao, Odd graceful labelings of some union
of graphs, J. Nat. Sci. Heilongjiang Univ, 24 (2007), 35-39.
12. R.B. Gnanajothi, Topics in Graph Theory, Ph.D. Theses, Madurai Kamaraj
University,1991. S.W. Golombo, How to number a graph in graph theory, and
Computing, R.C. Read, ed., Academic Press, New York (1972), 23-37.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Author
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
