Graceful Labeling of Bi-Partite Related Graphs

S. Sudha, Varatharajan Kanniga · International Journal of Mathematics and Soft Computing · 2015

In this paper we have shown that the the splitting graph of the complete bi-partite graph Km, n is graceful and the tensor product of the complete bi-partite graph Km, n and a path graph Pk(k> 1) is also graceful.

Read the paper · More papers on PaperTik