On Tades of Transformed Tree and Path Related Graphs

Abstract

Given a graph G. Consider a total labeling ξ : V E → {1,2,...,k}. 
Let e = xy and f = uv be any two different edges of G. Let wt(e)= wt(f) where wt(e) = |ξ(e)−ξ(x)−ξ(y)|. Then ξ is said to be edge irregular total absolute difference k-labeling of G. Then the total absolute difference edge irregularity strength of G, tades(G), is the least number k such that there is an edge irregular total absolute difference k-labeling for G. Here, we study the tades(G) of Tp-tree and path related graphs.

Key words and phrases. Total absolute difference edge irregularity strength, Tp-tree, Key graph.

2010 Mathematics Subject Classification. 0578