Results on Graceful Labeling

M M Jariya

doi:https://doi.org/10.14445/22315373/IJMTT-V65I8P508

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 8 | Year 2019 | Article Id. IJMTT-V65I8P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I8P508

Results on Graceful Labeling

M M Jariya

Abstract

In this paper we define smoothness of graceful labeling and we have discussed smoothness of Cn, K2,n and Pn. Last Theorem shows that any length of path is smooth graceful graph.

Keywords

labeling, smooth graceful labeling, bipartite graph.

References

[1] G. S. Bloom and S. W. Golomb, Numbered complete graphs, usual rules and assorted applications, in Theory and applications of Graphs, Lecture Notes in Math., 642, Springer-Verlag, New York (1978) 53 - 65.
[2] J. A. Gallian, The Electronics Journal of Combinatorics, 16, ]DS6(2013).
[3] R. Frucht, Graceful numbering of wheels and related graphs, Ann. N. Y. Acad. Sci.,319 (1979) 219-229.
[4] F. Harary, Graph theory Addition Wesley, Massachusetts, 1972.
[5] C. Hoede and H. Kuiper, All wheels are graceful, Util. Math., 14 (1987) 311.
[6] A. Rosa, On certain valuation of graph, Theory of Graphs (Rome, July 1966), Goden and Breach, N. Y. and Paris, 1967, 349-355.

Citation :

M M Jariya, "Results on Graceful Labeling," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 8, pp. 82-86, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I8P508