Mean Labeling of Some Graphs

A graph G with p vertices and q edges is a mean graph if there is an injective function f from the vertices of G to {0, 1, 2,. q} such that when each edge uv is labeled with (f (u) +f (v)) /2 if f (u) +f (v) is evenand (f (u) +f (v) +1) /2if f (u) +f (v) is odd then the resulting edges are distinct. In this paper we investigate mean labeling of shadow graph of bistar and comb and splitting graph of comb.