Open Access
January 2013 On totally magic cordial labeling
P. Jeyanthi, N. Angel Benseera, M. Immaculate Mary
Author Affiliations +
SUT J. Math. 49(1): 13-18 (January 2013). DOI: 10.55937/sut/1378308983

Abstract

A graph G is said to have totally magic cordial(TMC) 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 abE(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 investigate some new families of graphs that admit totally magic cordial labeling.

Acknowledgement

The authors are thankful to the referee for the valuable comments for a better presentation of the paper.

Citation

Download Citation

P. Jeyanthi. N. Angel Benseera. M. Immaculate Mary. "On totally magic cordial labeling." SUT J. Math. 49 (1) 13 - 18, January 2013. https://doi.org/10.55937/sut/1378308983

Information

Received: 11 August 2011; Revised: 19 July 2013; Published: January 2013
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1378308983

Subjects:
Primary: 05C78

Keywords: flower graph , ladder graph , total sequential cordial , Totally magic cordial

Rights: Copyright © 2013 Tokyo University of Science

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