On edge irregularity strength of certain families of snake graph

Abstract

Edge irregular mapping or vertex mapping β : V (U) → {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 wt_β(cd) = β(c)+β(d), ∀c, d ∈ V (U) and cd ∈ E(U). Edge irregularity strength denoted by es(U) is a minimum positive integer used to label vertices to form edge irregular labeling. The aim of this paper is to determine the exact value of edge irregularity strength of different families of snake graph.