• TOTAL EDGE IRREGULARITY STRENGTH OF SUBDIVIDED STAR GRAPH, TRIANGULAR SNAKE AND LADDER

Abstract

Given a graph G (V, E), a labeling ¶: VÈE® {1, 2… k} is called an edge irregular total k-labeling if for every pair of distinct edges uv and xy, ¶(u)+¶(uv)+¶(v) ¹ ¶(x) +¶(y) +¶(xy). The minimum k for which G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper we examine the total edge irregularity strength of Subdivided Star Graph, Triangular snake and Ladder.