Cordial Labeling of Kn;n related graphs

G. V. Ghodasara, A. H. Rokad

Abstract: It is proved by cahit that Km, n is cordial for all m and n. In this paper cordial labeling for three graphs related to complete bipartite graph Kn, n is discussed. We prove that (1) star of Kn, n, (2) path union of Kn, n, and (3) the graph obtained by joining two copies of Kn, n by a path of arbitrary length are cordial graphs

Keywords: complete bipartite graph Kn, n, Cordial graph, Path union