Cordial Labeling of Kn;n related graphs
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
How to Cite?: G. V. Ghodasara, A. H. Rokad, "Cordial Labeling of Kn;n related graphs", Volume 2 Issue 5, May 2013, International Journal of Science and Research (IJSR), Pages: 74-77, https://www.ijsr.net/getabstract.php?paperid=IJSROFF2013211, DOI: https://dx.doi.org/10.21275/IJSROFF2013211