Zero-M-Cordial Labeling of Some Graphs

In this paper we prove that the complete bipartite graph k_mn where m and n are even, join of two cycle graphs c_n and c_m where n + m ≡ 0 (mod 4), split graph of c_n for even “n”, K_n × P₂ where n is even are admits a Zero-M-Cordial labeling. Further we prove that K_n × P₂B_n = K_1,n × P₂ of odd n admits a Zero-M-Cordial labeling.