Edge irregular reflexive labeling on umbrella graphs U3,n and U4,n
Nabilla Ayu Rahmawati, Diari Indriati, Diari Indriati · AIP conference proceedings · 2021
Let G be an undirected and connected graph with vertex set V(G) and edge set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1, 2,…, ke} and a function fv : V(G) → {0,2,…,2kv}, where k = max {ke, 2kv} of a graph G such that the weights for all edge is distinct. Under f labeling for edges and vertices, the weight of edge xy in G, denoted by wt(xy) is defined as wt(xy) = f(x) + f(xy) + f(y). The minimum k for which the graph G has an edge irregular reflexive k-labeling is called the reflexive edge strength, denoted by res(G). This paper contains investigation of edge irregular reflexive k-labeling of umbrella graphs U3,n and U4,n.