TY - JOUR
ID - 7921
TI - Totally magic cordial labeling of some graphs
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
AU - Jeyanthi, P.
AU - Angel Benseera, N.
AD - 2Research Center, Department of Mathematics, Aditanar College for women, Tiruchendur - 628 216, India
AD - Department of Mathematics, Sri enakshi Government Arts College for Women (Autonomous), Madurai - 625 002, India.
Y1 - 2015
PY - 2015
VL - 46
IS - 1
SP - 1
EP - 8
KW - Cordial labeling
KW - Totally magic cordial labeling
DO -
N2 - 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.
UR - https://jac.ut.ac.ir/article_7921.html
L1 - https://jac.ut.ac.ir/article_7921_5e2b6a274667fa1b3976387dd2ecb005.pdf
ER -