4-TOTAL MEAN CORDIAL LABELING OF SOME TREES

Abstract

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 thelabel f (uv) = lf(u)+f(v)2m. f is called a k-total mean cordial label ing of G if |tmf (i) − tmf (j)| ≤ 1, for all i,j ∈ {0, 1, 2,... ,k − 1},where tmf (x) denotes the total number of vertices and edges la belled with x, x ∈ {0, 1, 2,... ,k − 1}. A graph with admit a k-totalmean cordial labeling is called k-total mean cordial graph. In thispaper we examine the 4-Total mean cordial labeling of some trees