%0 Journal Article
%T Totally magic cordial labeling of some graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jeyanthi, P.
%A Angel Benseera, N.
%D 2015
%\ 09/01/2015
%V 46
%N 1
%P 1-8
%! Totally magic cordial labeling of some graphs
%K Cordial labeling
%K Totally magic cordial labeling
%R
%X 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.
%U https://jac.ut.ac.ir/article_7921_5e2b6a274667fa1b3976387dd2ecb005.pdf