Even-Odd Prime Harmonious Graphs

The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method. Naturally, Graphs arose in the study of Graham and Slaone Modular versions of additive based problems. Hence, the researcher have introduced Even-Odd Prime Harmonious Labeling of Graphs and I prove that the Path Pn where n is odd, Star K1,n and Comb graph Pn . K1, n is even, are even-odd harmonious graphs. By the use of even-odd prime harmonious labeling concepts, one can find out the significance of even-odd prime harmonious graphs.