Open Access
January 2013 Totally vertex-magic cordial labeling
P. Jeyanthi, N. Angel Benseera
Author Affiliations +
SUT J. Math. 49(1): 1-12 (January 2013). DOI: 10.55937/sut/1378309917

Abstract

In this paper, we introduce a new labeling called Totally Vertex-Magic Cordial(TVMC) labeling. A graph G(p,q) is said to be TVMC with a constant C if there is a mapping f:V(G)E(G){0,1} such that

[f(a)+bN(a)f(ab)]C(mod2)

for all vertices aV(G) and |nf(0)nf(1)|1, where N(a) is the set of vertices adjacent to the vertex a and nf(i)(i=0,1) is the sum of the number of vertices and edges with label i.

Acknowledgement

The authors sincerely thank the referee for the valuable comments and suggestions for a better presentation of the paper.

Citation

Download Citation

P. Jeyanthi. N. Angel Benseera. "Totally vertex-magic cordial labeling." SUT J. Math. 49 (1) 1 - 12, January 2013. https://doi.org/10.55937/sut/1378309917

Information

Received: 21 September 2010; Revised: 26 May 2013; Published: January 2013
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1378309917

Subjects:
Primary: 05C78

Keywords: friendship graph , sun graph , Totally vertex-magic cordial

Rights: Copyright © 2013 Tokyo University of Science

Vol.49 • No. 1 • January 2013
Back to Top