Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs

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.