| Abstract |
IA total edge irregular k-labelling λ of a graph G=(V,E) is a labelling of vertices V and edges E with labels from the set {1, 2, . . ., k} in such a way that for any two different edges ‘e’ and ‘f’ the weights are different i.e. wt(e)≠ wt(f). Here the weight of an edge e=uv ; v, u ? V and wt(e)= λ(u)+λ(e)+λ(v) i.e. sum of labels of vertices u, v and of the edge e. The minimum k for which the graph G has an edge irregular total k-labelling is called the total edge irregularity strength of G i.e. tes(G). In this talk, we will discuss various techniques used to determine the exact value of the total edge irregular strength for complete graph.
|
