Opuscula Mathematica
Opuscula Math. 34, no. 1 (), 115-122
http://dx.doi.org/10.7494/OpMath.2014.34.1.115
Opuscula Mathematica

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



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

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

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.