Document Type : Research Paper
Authors
1 Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India
2 Sri Paramakalyani College Alwarkurichi-627412, Tamilnadu, India
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 the
label f (uv) = l
f(u)+f(v)
2
m
. f is called a k-total mean cordial labeling 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 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
Keywords
)