Zero-M-Cordial Labeling of Some Graphs

Freeda Selvanayagom, Robinson S. Chellathurai

Department of Mathematics, Scott Christian College, Nagercoil, India.

DOI: 10.4236/am.2012.311228                

Abstract

In this paper we prove that the complete bipartite graph k_mn where m and n are even, join of two cycle graphs c_n and c_m where n + m ≡ 0 (mod 4), split graph of c_n for even “n”, K_n × P₂ where n is even are admits a Zero-M-Cordial labeling. Further we prove that K_n × P₂B_n = K_1,n × P₂ of odd n admits a Zero-M-Cordial labeling.

Keywords

Zero-M-Cordial Labeling; Split Graphs; Cartesian Product; H-Cordial

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	I. Cahit, “H-Cordial Graphs,” Bulletin of the Institute of Combinatorics and Its Applications, Vol. 18, 1996, pp. 87-101.
[2]	M. Ghebleh and R. Khoeilar, “A Note on ‘H-Cordial graphs’,” Bulletin of the Institute of Combinatorics and Its Applications, Vol. 31, 2001, pp. 60-68.
[3]	J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronics Journal of Combinatories, Vol. 18, 2011.
[4]	F. Harary, “Graph Theory,” Addison Wesley, Reading, 1972.