Zero-M-Cordial Labeling of Some Graphs

doi:10.4236/am.2012.311228

Home > Journals > Physics & Mathematics > AM

AM> Vol.3 No.11, November 2012

Share This Article:

Open Access

Zero-M-Cordial Labeling of Some Graphs

Full-Text HTML

Download as PDF (Size:213KB) PP. 1648-1654

DOI: 10.4236/am.2012.311228 2,617 Downloads 4,178 Views

Author(s) Leave a comment

Freeda Selvanayagom, Robinson S. Chellathurai

Affiliation(s)

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

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.

Cite this paper

F. Selvanayagom and R. Chellathurai, "Zero-M-Cordial Labeling of Some Graphs," Applied Mathematics, Vol. 3 No. 11, 2012, pp. 1648-1654. doi: 10.4236/am.2012.311228.

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.