Note on edge irregular reflexive labelings of graphs

For a graph G, an edge labeling f(e) : E(G) -> {1, 2, ..., k(e)} and a vertex labeling f(v) : V(G) -> {0, 2, 4, ..., 2k(v)} are called total k-labeling, where k = max{k(e), 2k(v)}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two different edges xy and x' y' of G, one has wt(xy) = f(v)(x) + f(e)(xy) + f(v)(y) not equal wt(x'y') = f(v)(x') + f(e)(x'y') + f(v)(y'). The minimum k for which the graph G has an edge irregular reflexive k-labeling is called the reflexive edge strength of G. In this paper we determine the exact value of the reflexive edge strength for cycles, Cartesian product of two cycles and for join graphs of the path and cycle with 2K(2). (C) 2018 Kalasalingam University. Production and Hosting by Elsevier B.V.