Zero-M-Cordial Labeling of Some Graphs

• 作者: Freeda Selvanayagom Robinson S. Chellathurai
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: Zero-M-Cordial LABELING Split GRAPHS CARTESIAN Product H-Cordial
• 年，卷（期）: 2012,（11）
• 页码范围: 1648-1654
• 页数: 7页
• 分类号: O1

摘要

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.