@article {
author = {Ponraj, R. and Sathish Narayanan, S.},
title = {Further results on total mean cordial labeling of graphs},
journal = {Journal of Algorithms and Computation},
volume = {46},
number = {1},
pages = {73-83},
year = {2015},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2015.7926},
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) = [(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.},
keywords = {cycle,Path,union of graphs,Star,ladder},
url = {https://jac.ut.ac.ir/article_7926.html},
eprint = {https://jac.ut.ac.ir/article_7926_9d2173db725a3759d46d6f1e33486b61.pdf}
}