Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs

For a graph G, we define a total k-labeling ϕ as a combination of an edge labeling ϕe(x) → {1, 2, . . . , ke} and a vertex labeling ϕv(x) → {0, 2, . . . , 2kv}, such that ϕ(x) = ϕv(x) if x ∈ V (G) and ϕ(x) = ϕe(x) if x ∈ E(G), where k = max {ke, 2kv}. The total k-labeling ϕ is called an edge irregular reflexive k-labeling of G, if for every two edges xy, x0y0of G, one has wt(xy) 6=wt(x0y0), where wt(xy) = ϕv(x) + ϕe(xy) + ϕv(y). The smallest value of k for which such labeling exists is called a reflexive edge strength of G. In this paper, we study the edge irregular reflexive labeling on plane graphs and determine its reflexive edge strength.