Abstract
A graph is said to have totally magic cordial(TMC) labeling with constant if there exists a mapping such that for all and , where is the sum of the number of vertices and edges with label . 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
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