Zero-M-Cordial Labeling of Some Graphs

HTML  Download Download as PDF (Size: 213KB)  PP. 1648-1654  
DOI: 10.4236/am.2012.311228    3,686 Downloads   5,797 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.

Share and Cite:

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.

Copyright © 2024 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.