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) = [(f(x)+f(y))/2] 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 Cn2, ladder Ln, book Bm and some more graphs.
Ponraj,R and Sathish Narayanan,S . (2015). Further results on total mean cordial labeling of graphs. Journal of Algorithms and Computation, 46(1), 73-83. doi: 10.22059/jac.2015.7926
MLA
Ponraj,R , and Sathish Narayanan,S . "Further results on total mean cordial labeling of graphs", Journal of Algorithms and Computation, 46, 1, 2015, 73-83. doi: 10.22059/jac.2015.7926
HARVARD
Ponraj R, Sathish Narayanan S. (2015). 'Further results on total mean cordial labeling of graphs', Journal of Algorithms and Computation, 46(1), pp. 73-83. doi: 10.22059/jac.2015.7926
CHICAGO
R Ponraj and S Sathish Narayanan, "Further results on total mean cordial labeling of graphs," Journal of Algorithms and Computation, 46 1 (2015): 73-83, doi: 10.22059/jac.2015.7926
VANCOUVER
Ponraj R, Sathish Narayanan S. Further results on total mean cordial labeling of graphs. J. Algo. Comp.. 2015;46(1):73-83. doi: 10.22059/jac.2015.7926
