TY  - JOUR
ID  - Jeyanthi2014
LB  - Jeyanthi2014
AU  - Jeyanthi, P.
AU  - Benseera, N. Angel
TI  - A totally magic cordial labeling of one-point union of n copies of a graph
ST  - A totally magic cordial labeling of one-point union of n copies of a graph
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2014
VL  - 34
IS  - 1
SP  - 115
EP  - 122
DO  - http://dx.doi.org/10.7494/OpMath.2014.34.1.115
UR  - http://dx.doi.org/10.7494/OpMath.2014.34.1.115
AB  - A graph \(G\) is said to have a totally magic cordial (TMC) labeling with constant \(C\) if there exists a mapping \(f: V(G)\cup E(G)\rightarrow \left\{0,1\right\}\) such that \(f(a) + f(b) + f(ab) \equiv C(\mbox{mod 2})\) for all \(ab\in E(G)\) and \(\left|n_f(0)-n_f(1)\right|\leq1\), where \(n_f(i)\) \((i = 0, 1)\) is the sum of the number of vertices and edges with label \(i\). In this paper, we establish the totally magic cordial labeling of one-point union of \(n\)-copies of cycles, complete graphs and wheels.
KW  - totally magic cordial labeling
KW  - one-point union of graphs
SN  - 1232-9274
ER  -