Some Properties of k-Mean Labeling

A graph G with p vertices and q edges is called a k-mean labeling (k-ML) if there is an injective function f from the vertices of G to {0,1,2,...,k + q−1} such that when each edge uv is labeled with * ( ) ( ) ( ) 2 f u f v f uv         then the resulting edge labels {k, k + 1,k + 2,...,k + q−1} are all distinct. A graph that admits k-mean labeling is called a k-mean graph(k-MG)