Abstract
Let G be a simple graph with vertex set V(G) and edge set E(G), respectively. An edge irregular k-labeling of G is a labeling of V(G) with labels from the set {1, 2, ... , k} in such a way that for any two different edges e and f, their weights w(e) and w(f) are distinct. The weight of an edge xy in G is the sum of the labels of the end vertices x and y. The minimum k for which the graph G has an edge irregular k-labeling is called the edge irregularity strength of G, denoted by es(G). In this paper, we determine the exact value of edge irregularity strength of corona product of graphs with cycle.