4-Total Mean Cordial Labeling of Some Trees.

Let G be a graph. Let f : V (G) → {0, 1, 2, . . ., k -- 1} be a function where k ∈ N and k > 1. For each edge uv, assign the label f (uv) = [f(u)+f(v)/2]. f is called a k-total mean cordial labeling of G if |t_mf (i) -- t_mf (j)| ≤ 1, for all i, j ∈ {0, 1, 2, . . ., k -- 1}, where t_mf (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, 2, . . ., k -- 1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph. In this paper we examine the 4-Total mean cordial labeling of some trees. [ABSTRACT FROM AUTHOR]