Edge Irregularity Strength of Graphs on Mean Labeling

Abstract

Let  be a connected graph of order . Let  be a function and let the weight of an edge  be defined by . Then,  is called an edge irregular mean labeling, if all the edge weights are distinct. The edge irregularity strength  is the smallest positive integer  such that there is an edge irregular mean labeling . In this paper, we determine the exact value of edge irregularity strength of some classes of graphs.