| Summary: | 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) = φpv (x) if x (Formula presented) V(G) and φ(x) = φe(x) if x (Formula presented) E(G), where k = max {ke, 2kv}. The total k-labeling p is called an edge irregular reflexive k-labeling of G, if for every two edges xy, x'y' of G, one has wt(xy) = wt(x'y'), 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. © 2022. All Rights Reserved.
|
|---|