Abstract
Graph labeling is an assignment of (usually) positive integers to elements of a graph (vertices and/or edges) satisfying certain condition(s). In the last two decades, graph labeling research received much attention from researchers. This articles is about edge irregularity strength for some classes of plane graphs. Edge irregularity strength denoted by es(G), was introduced by Ahmad et al. in 2014 as a modification of the well known irregularity strength by Chartrand in 1988. In this paper, the exact value of the edge irregularity strength for some clases of plane graphs is determined.