Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs
M. Kalaimathi1, B. J. Balamurugan2
1M. Kalaimathi, Mathematics Division, School of Advanced Sciences, VIT University, Chennai (Tamil Nadu), India.
2B. J. Balamurugan, Mathematics Division, School of Advanced Sciences, VIT University, Chennai (Tamil Nadu), India.
Manuscript received on 18 December 2019 | Revised Manuscript received on 24 December 2019 | Manuscript Published on 31 December 2019 | PP: 414-419 | Volume-9 Issue-1S3 December 2019 | Retrieval Number: A10751291S319/19©BEIESP | DOI: 10.35940/ijeat.A1075.1291S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© 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: Let G V E ( , ) be a graph with p number of vertices and q number of edges. An injective function f V p : 1,3,5, ,2 1 → − is called an even-odd harmonious labeling of the graph G if there exists an induced edge function : 0,2, ,2 1 → − ( ) * f E q such that i) * f is bijective function ii) ( = = + ) ( ( ) ( ))( 2 ) * f e uv f u f v mod q The graph obtained from this labeling is called even-odd harmonious graph.
Keywords: Graphs, Even-Odd Harmonious Labeling, Injective Function, Bijective Function.
Scope of the Article: Cryptography and Applied Mathematics