Zero-M-Cordial Labeling of Some Graphs  

作　　者：Freeda Selvanayagom Robinson S. Chellathurai 

机构地区：[1]Department of Mathematics, Scott Christian College, Nagercoil, India

出　　处：《Applied Mathematics》2012年第11期1648-1654,共7页应用数学（英文）

摘　　要：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.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.

关 键 词：Zero-M-Cordial LABELING Split GRAPHS CARTESIAN Product H-Cordial 

分 类 号：O1[理学—数学]