Distance Irregular Labeling Of Ladder Graph And Triangular Ladder Graph

ABSTRACT

In this paper, we discussed graph labelings that the distance irregular labeling within which will be presented the results of the distance irregularity strength of ladder graph and triangular ladder graph. The distance irregular labeling on a graph  with  vertices is defined as an assignment  so that the weights calculated at vertices are distinct. The weight of a vertex  in  is defined as the sum of the labels of all the vertices adjacent to  (distance 1 from ), that is, . The distance irregularity strength of , denoted by dis(G), is the minimum value of the largest label  over all such irregular assignments.

FULL TEXT