Research Paper | Mathematics | India | Volume 2 Issue 5, May 2013
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
Edition: Volume 2 Issue 5, May 2013,
Pages: 74 - 77
How to Cite this Article?
G. V. Ghodasara, A. H. Rokad, "Cordial Labeling of Kn;n related graphs", International Journal of Science and Research (IJSR), https://www.ijsr.net/get_abstract.php?paper_id=IJSROFF2013211, Volume 2 Issue 5, May 2013, 74 - 77, #ijsrnet
How to Share this Article?
Similar Articles with Keyword 'n'
Number Theoretic Functions and Coordinate Geometry
A Study on Graph with Desmos through ICT in Diploma in Elementary Education of Tamil Nadu State Board
P. Charles Paul | G. Thulasi