181-190
Total Means Cordiality of some Derived Graphs
Authors: R. Ponraj and S.Sathish Narayanan
Number of views: 452
A total mean cordial labeling of a graph G = (V,E) is a function
f : V (G) ! {0, 1, 2} such that for each edge xy assign the label l f(x)+f(y)
2 m
where x, y 2 V (G) and
evf (i) − evf (j)
6 1, i, j 2 {0, 1, 2} where evf (x)
denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If
there exists a total mean cordial labeling on a graph G, we will call G is total
mean cordial. In this paper, we investigate the total mean cordial labeling
behavior of some derived graphs.