Share This Article:

Zero-M-Cordial Labeling of Some Graphs

Full-Text HTML Download Download as PDF (Size:213KB) PP. 1648-1654
DOI: 10.4236/am.2012.311228    2,617 Downloads   4,178 Views  

ABSTRACT

In this paper we prove that the complete bipartite graph kmn where m and n are even, join of two cycle graphs cn and cm where n + m ≡ 0 (mod 4), split graph of cn for even “n”, Kn × P2 where n is even are admits a Zero-M-Cordial labeling. Further we prove that Kn × P2Bn = K1,n × P2 of odd n admits a Zero-M-Cordial labeling.

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.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.