Zero-M-Cordial Labeling of Some Graphs

Abstract

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 2 where n is even are admits a Zero-M-Cordial labeling. Further we prove that K n × P 2 B n = K 1, n × P 2 of odd n admits a Zero-M-Cordial labeling.