TITLE:
Zero-M-Cordial Labeling of Some Graphs
AUTHORS:
Freeda Selvanayagom, Robinson S. Chellathurai
KEYWORDS:
Zero-M-Cordial Labeling; Split Graphs; Cartesian Product; H-Cordial
JOURNAL NAME:
Applied Mathematics,
Vol.3 No.11,
November
20,
2012
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.