Abstract
For a simple graph [ ], a vertex labeling [ ] is called a [ ]-labeling. The weight of an edge [ ] in [ ], denoted by [ ], is defined as the sum of the labels of its end vertices [ ] and [ ], i.e., [ ]. A [ ]-labeling is considered an edge-irregular [ ]-labeling if the weights of any two distinct edges are different, that is, [ ] for all pairs of distinct edges [ ] and [ ]. The smallest integer [ ] for which such an edge irregular [ ]-labeling exists is the edge irregularity strength of [ ], denoted by es[ ]. In this paper, we find the exact value for the edge irregular [ ]-labeling for uniform theta graphs [ ] for [ ] and [ ] [ ]; [ ] and [ ] [ ]; [ ] [ ], and for two classes of generalized 4-prism graphs [ ] and [ ]. Additionally, this paper discusses an application of edge irregularity strength of graphs for the optimal path selection in communication networks.

This publication has 9 references indexed in Scilit: