Opuscula Math. 34, no. 1 (2014), 115-122

Opuscula Mathematica

A totally magic cordial labeling of one-point union of n copies of a graph

P. Jeyanthi
N. Angel Benseera

Abstract. 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.

Keywords: totally magic cordial labeling, one-point union of graphs.

Mathematics Subject Classification: 05C78.

Full text (pdf)

  • P. Jeyanthi
  • Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur - 628 215, India
  • N. Angel Benseera
  • Department of Mathematics, Sri Meenakshi Government Arts College for Women (Autonomous), Madurai - 625 002, India
  • Received: 2013-06-10.
  • Revised: 2013-09-14.
  • Accepted: 2013-09-21.
Opuscula Mathematica - cover

Cite this article as:
P. Jeyanthi, N. Angel Benseera, A totally magic cordial labeling of one-point union of n copies of a graph, Opuscula Math. 34, no. 1 (2014), 115-122, http://dx.doi.org/10.7494/OpMath.2014.34.1.115

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.