Some New Odd prime Graphs

Abstract

For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one. In this paper we investigate the existence of odd prime labeling of some new classes of graphs and we prove that the graphs such as the Z -Pn graph, Fish graph, Umbrella graph, Cocount tree , F-tree, Y -tree and Double Sunflower graph are odd prime graphs.

Keywords

• odd prime graph, z − pn graph, fish graph, umbrella graph,cocount tree , f-tree, y -tree, double sunflower graph.