Some results on (k, d) - even mean labeling

Let G(V, E) be a graph with p vertices and q edges. A labeling is an assignment of numbers to vertices. For every labeling f : V(G) {0, 1, 2,…, q}, an induced edge labeling f*: E(G) {1,2,…,q}is defined by , if f(u) and f(v) are of same parity and , otherwise. If the resulting edge labels are distinct, then f is called a mean labeling of G. If for a labeling f : V(G) {0, 1, 2,…, 2k+2(q-1)d}, f*(E) ={2k, 2k+2d, …, 2k+2(q-1)d}, then f is called a (k, d) - even mean labeling of G. In this paper, we prove some results on (k, d) - even mean labeling of some graphs.