Lehmer-4 Mean Labeling for some Path Related Graphs

A graph G=(V,E) with p vertices and q edges is called Lehmer-4 mean graph, if it is possible to label vertices xεV with distinct label g(x) from 2,4,6,8,.….…... 2p in such a way that when each edge e = uv is labeled with , then the edge labels are distinct. In this case, g is called Lehmer-4 mean labeling of G. In this paper, Lehmer-4 mean labeling for some path related graphs have been introduced.