Some Results on 4-Total Difference Cordial Graphs.

Let G be a graph. Let f : V (G) → {0; 1; 2; ⋯, k - 1} be a map where k ∈ ℕ 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 |tdf (i) - tdf (j)| ≤ 1, i, j ∈ {0; 1; 2; ⋯ ; k - 1} where tdf (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. [ABSTRACT FROM AUTHOR]