Odd Graceful Labelling of the Union of Cycle and Lobsters
Keywords:
Graceful labeling, Odd graceful labeling, Cycle, LobsterAbstract
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.
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).
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.
