Some families of 4-total difference cordial graphs

Abstract

Let G be a graph. Let f: V(G) → {0,1,2,...,k − 1} be a map where k ∈ N and k > 1. For each edge uv, assign the label | f(u)− f(v)|. f is called k-total difference cordial labeling of G if td f(i)−td f(j) ≤ 1, i, j ∈ {1,2,...,k} where td f(x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of some graphs like Jn,n∪K1,n,Jn,n∪Bn,n,Jn,n∪Pn etc.