Author/Authors :
Ponraj, R Department of Mathematics - Sri Paramakalyani College - Alwarkurichi, India , Sathish Narayanan, S Department of Mathematics - Sri Paramakalyani College - Alwarkurichi, India
Abstract :
A graph G = (V,E) with p vertices and q edges is said to
be a total mean cordial graph if there exists a function
f : V (G) → {0, 1, 2} such that f(xy) = lf(x)+f(y)
2 m
where x, y ∈ V (G), xy ∈ E(G), and the total number of
0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1,
i, j ∈ {0, 1, 2} where evf (x) denotes the total number of
vertices and edges labeled with x (x = 0, 1, 2). In this
paper, we investigate the total mean cordial labeling of
C2n
, ladder Ln, book Bm and some more graphs.
Keywords :
cycle , path , union of graphs , star , ladder
