• G.Chitra
• Y.Vishnupriya

Let G be a Graph with p vertices and q edges an injective function f : V(G) {1,3,5,…2q +1} such that gcd ( f(u),f(v) ) =1 and the induced edge labelings f*: E(G) {2,4,6,…2p -2} are defined f(uv) = , if f(u)+f(v) is even , if f(u)+f(v) is odd is called a prime mean labeling. A graph which admits an odd mean labelings are a prime odd mean labeling graph.

Prime Odd Mean Labeling, Bull graph, Caterpillar graph, Cycle, Kite graph, Ladder graph, Path, Peterson graph, Spider graph, Star graph, Tree.

"Prime Odd Mean Labeling of Some Sepcial Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 6, page no.745-749, June-2018, Available :http://www.jetir.org/papers/JETIR1806795.pdf

"Prime Odd Mean Labeling of Some Sepcial Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 6, page no. pp745-749, June-2018, Available at : http://www.jetir.org/papers/JETIR1806795.pdf