Further results on edge irregularity strength of graphs.

For a graph G = (V, E) , let φ : V(G) → {1,2,.., k} to be vertex k-labeling. An edge irregular k-labeling is defined as follows: for each edge e= xy a weight wt(xy) is given by wt(xy)= φ(x)+φ(y) such that wt(xy)≠ wt(x'y') for every two different edges xy and x'y'. The edge irregularity strength of G, written by es(G), is the least k for which the graph G has an edge irregular k –labeling. We study this parameter for various families of graphs. [ABSTRACT FROM AUTHOR]