Open Access   Article Go Back

Some Cordial Labeling on Human Chain Graph

K. Anitha1 , B. Selvam2 , K. Thirusangu3

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-05 , Page no. 81-84, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si5.8184

Online published on Mar 10, 2019

Copyright © K. Anitha, B. Selvam, K. Thirusangu . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: K. Anitha, B. Selvam, K. Thirusangu, “Some Cordial Labeling on Human Chain Graph,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.81-84, 2019.

MLA Style Citation: K. Anitha, B. Selvam, K. Thirusangu "Some Cordial Labeling on Human Chain Graph." International Journal of Computer Sciences and Engineering 07.05 (2019): 81-84.

APA Style Citation: K. Anitha, B. Selvam, K. Thirusangu, (2019). Some Cordial Labeling on Human Chain Graph. International Journal of Computer Sciences and Engineering, 07(05), 81-84.

BibTex Style Citation:
@article{Anitha_2019,
author = {K. Anitha, B. Selvam, K. Thirusangu},
title = {Some Cordial Labeling on Human Chain Graph},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {81-84},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=810},
doi = {https://doi.org/10.26438/ijcse/v7i5.8184}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.8184}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=810
TI - Some Cordial Labeling on Human Chain Graph
T2 - International Journal of Computer Sciences and Engineering
AU - K. Anitha, B. Selvam, K. Thirusangu
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 81-84
IS - 05
VL - 07
SN - 2347-2693
ER -

           

Abstract

A Human chain graph is a simple, finite and undirected geaph. In this paper, we prove that the existence of V-cordial and Homo-cordial labeling for the Human chain graph by using algorithms.

Key-Words / Index Term

Human chain, Cordial, V-cordial, Homo-cordial, Labeling

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. 189198, 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. 433436, 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. 15, 2015.
[7] Selvam, Avadayappan, M. Bhuvaneshwari, M. vasanthi, “Homo Cordial Graphs”, International Journal of Scientific Research, Vol. 5, Issue 5, pp. 700724, 2016.