k-Total difference cordial graphs

Let G be a graph. Let f : V (G) ! f0; 1; 2; : : : ; k 􀀀 1g be a map where k 2 N and k > 1. For each edge uv, assign the label jf(u) 􀀀 f(v)j. f is called a k- total dierence cordial labeling of G if jtdf (i) 􀀀 tdf (j)j 1, i; j 2 f0; 1; 2; : : : ; k 􀀀 1g where tdf (x) denotes the total number of vertices and the edges labeled with x.A graph with admits a k-total difference cordial la- beling is called a k-total difference cordial graphs. We investigate k-total difference cordial labeling of some graphs and study the 3-total difference cordial labeling behaviour of star,bistar,complete bipartiate graph,comb,wheel,helm,armed crown etc.