Some Cordial Labeling on Human Chain Graph
Keywords:
Human chain, Cordial,, V-cordial,, Homo-cordial, LabelingAbstract
A Human chain graph is a simple, finite and undirected geaph. In this paper, we prove that the existence of Vcordial and Homo-cordial labeling for the Human chain graph by using algorithms
References
[1] K. Anitha, B. Selvam, “Human chain graph”, International journal of Engineering, Science and Mathematics, Vol. 7, Issue 8, 2018.
[2] Cahit, “On cordial and 3-equitable labelings of graphs”, Util. Math., Vol. 37, pp. 189198, 1990.
[3] J.A. Gallian, “A Dynamic Survey of graph labeling”, the Electronic Journal of combinatories, 19, # DS6, 2012.
[4] A. Nellai Murugan, P. Iyadurai Selvaraj, “Path Related Cup Cordial Graphs”, Indian Journal of Applied Research. Vol. 4, Issue 8, pp. 433436, 2011.
[5] A. Nellai Murugan, A. Madhubala, “Path Related Homo-Cordial Graphs”, International Journal of Innovative Science Engineering and Technology, Vol. 2, Issue 8, 2015.
[6] A. Nellai Murugan, A. Madhubala, “Special case of Homo-Cordial Graphs”, International Journal of Emerging Technologies in Engineering research, Vol. 2, Issue 3, pp. 15, 2015.
[7] Selvam, Avadayappan, M. Bhuvaneshwari, M. vasanthi, “Homo Cordial Graphs”, International Journal of Scientific Research, Vol. 5, Issue 5, pp. 700724, 2016.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
