Resumen de On edge irregularity strength of different families of graphs

Muhammad Ibrahim, Murat Cancan, Yasir Ali, Anum Anum, Jamila Aslam

• Edge irregular mapping or vertex mapping h : V (G) → {1,2,3,...,s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c) + h(d), ∀c, d ∈ V(G) and ∀cd ∈ E(G). Edge irregularity strength denoted by es(G) is a minimum positive integer used to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of linear phenylene graph PHn, Bn graph and different families of snake graph.