Some Results on (K, D) - Even Mean Labeling
S. Kalaimathy · International Journal of Mathematics and Soft Computing · 2012
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 2 vfuf uvf , if f(u) and f(v) are of same parity and 2