On Edge Irregularity Strength of Mycielskian of Paths and Cycles

For a graph G having no loops and parallel edges, a labeling on the vertex set of G,Ψ:V(G)→{1,2,…,α} is refers to α-labeling. Let ab∈G be an edge. Then the weight the edge ab is zΨ (ab)=Ψ(a)+Ψ(b). An α-labeling on the vertex set of G is refers to be an edge irregular α-labeling of G if zΨ (a)≠zΨ (b),where a≠b in G. The least number α for which the graph G has an edge irregular α-labeling is referred to the edge irregularity strength of G, written es(G). The edge irregularity strength of Mycielskian of paths and cycles is computed.