Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs
M. Kalaimathi, B1. J. Balamurugan2

1M. Kalaimathi*, Mathematics Division, school of Advanced Sciences, VIT University, Chennai, Tamil Nadu, India.
2Dr. B. J. Balamurugan, Mathematics Division, school of Advanced Sciences,, VIT University, Chennai, Tamil Nadu, India.
Manuscript received on January 12, 2020. | Revised Manuscript received on January 22, 2020. | Manuscript published on February 10, 2020. | PP: 2967-2974 | Volume-9 Issue-4, February 2020. | Retrieval Number: D2033029420/2020©BEIESP | DOI: 10.35940/ijitee.D2033.029420
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: IAn even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,…,2q-1 to the vertices through a 1-1 computing function f and even numbers 0,2,4,…,2( P-1)  to the edges through a bijective computing function f *with the condition that f* (e = uv)= (f (u) + f (v)(mod2q )  where u and v are the vertices of G . This type of labelled graph is called as even-odd harmonious graph.
Keywords: Graphs, Even-Odd Harmonious Labeling, Injective Function, Bijective Function.
Scope of the Article: Graph Algorithms And Graph Drawing