Root Cube even Mean Labeling of Graph

A graph G = (V,E) with p vertices and q edges is said to be a Root Cube Even Mean Graph if it is possible to label the vertices x V with distinct elements f(x) from 1,2......,q+1 in such a way that when each edge e = uv is labeled with , then the resulting edge labels are distinct. Here f is called a Root Cube Even Mean Labeling of G. In this paper we prove that path, comb, P_n⊙K_1,2 is a root cube even Mean Labeling graph.