Downloads: 131 | Views: 141
Research Paper | Mathematics | India | Volume 2 Issue 5, May 2013
Cordial Labeling of Kn;n related graphs
G. V. Ghodasara [3] | A. H. Rokad [2]
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
Similar Articles with Keyword 'n'
Downloads: 52 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 10 Issue 2, February 2021
Pages: 756 - 759Number Theoretic Functions and Coordinate Geometry
Downloads: 153 | Weekly Hits: ⮙1 | Monthly Hits: ⮙2
Research Paper, Mathematics, India, Volume 6 Issue 11, November 2017
Pages: 1792 - 1796A Study on Graph with Desmos through ICT in Diploma in Elementary Education of Tamil Nadu State Board
P. Charles Paul | G. Thulasi [2]