Open Access   Article Go Back

Odd Graceful Labelling of the Union of Cycle and Lobsters

J.JebaJesintha 1 , Jayaglory.R 2 , Bhabita G3

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

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

Online published on Mar 10, 2019

Copyright © J.JebaJesintha, Jayaglory.R, Bhabita G . 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: J.JebaJesintha, Jayaglory.R, Bhabita G, “Odd Graceful Labelling of the Union of Cycle and Lobsters,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.59-63, 2019.

MLA Style Citation: J.JebaJesintha, Jayaglory.R, Bhabita G "Odd Graceful Labelling of the Union of Cycle and Lobsters." International Journal of Computer Sciences and Engineering 07.05 (2019): 59-63.

APA Style Citation: J.JebaJesintha, Jayaglory.R, Bhabita G, (2019). Odd Graceful Labelling of the Union of Cycle and Lobsters. International Journal of Computer Sciences and Engineering, 07(05), 59-63.

BibTex Style Citation:
@article{G_2019,
author = {J.JebaJesintha, Jayaglory.R, Bhabita G},
title = {Odd Graceful Labelling of the Union of Cycle and Lobsters},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {59-63},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=805},
doi = {https://doi.org/10.26438/ijcse/v7i5.5963}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.5963}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=805
TI - Odd Graceful Labelling of the Union of Cycle and Lobsters
T2 - International Journal of Computer Sciences and Engineering
AU - J.JebaJesintha, Jayaglory.R, Bhabita G
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 59-63
IS - 05
VL - 07
SN - 2347-2693
ER -

           

Abstract

Odd graceful labeling is one of the major evolving research areas in the field of graph labeling. It is defined as for any graph G with q edges if there is an injection f from V(G) to {0, 1, 2, …, (2q-1)} such that, when each edge xy is assigned the label │f(x) ─ f(y)│,so that the edge labels are {1, 3, 5, …, (2q-1)} then the graph G is said to be odd graceful. Graph labeling has a vast range of real life applications which has provided major contributions in the development of new technologies. In this paper we have investigated and proved that the graph G which is obtained by joining m isomorphic copies of lobster graph to each vertex of the cycle Cm admits odd graceful labeling.

Key-Words / Index Term

Graceful labeling, Odd graceful labeling, Cycle, Lobster

References

[1] C. Barrientos, Odd-graceful labelings, preprint.
[2] J. A.Gallian, Electronics Journal of Combinatorics, (2017).
[3] Gnanajothi R.B., Ph. D. Thesis, Madurai Kamaraj University,(1991).
[4] S. W. Golomb, How to number a graph, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York (1972).
[5] D Morgan – All lobsters with perfect matching are odd graceful, Electronic notes in Discrete Mathematics, (2002).
[6] M.I. Moussa, The International Journal on Application of Graph Theory in Wireless Ad hoc Networks,2(2010).
[7] M.I. Moussa, Some simple algorithm for odd graceful labeling graphs, proceed9th WSEAS Internat. Conf. Applied Informatics and Communications (AI `09) August, 2009, Moscow, Russia.
[8] M. I. Moussa and E. M. Badr, Odd graceful labelings of crown graphs, 1s Internat. Conf.
[9] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Pari (1967).
[10] Zhou, Yao, Chen and Tao a proof to the odd-gracefulness of all lobsters, Ars Combin., (2012).