@article {
author = {Jeyanthi, P. and Angel Benseera, N.},
title = {Totally magic cordial labeling of some graphs},
journal = {Journal of Algorithms and Computation},
volume = {46},
number = {1},
pages = {1-8},
year = {2015},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and also prove that some families of graphs admit totally magic cordial labeling.},
keywords = {Cordial labeling,Totally magic cordial labeling},
url = {https://jac.ut.ac.ir/article_7921.html},
eprint = {https://jac.ut.ac.ir/article_7921_5e2b6a274667fa1b3976387dd2ecb005.pdf}
}