Expanding graceful trees

I Nengah Suparta, I Dewa M. Agus Ariawan


Two methods for expanding graceful trees are introduced. In constructing a larger graceful trees, these methods are based on a collection of certain graceful trees and one graceful tree as the core of the produced graceful tree. 


graceful labeling, graceful tree, interlaced tree

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2020.8.2.2


U.N. Deshmukh, Applications of graceful graphs, International Journal of Engineering Sciences and Research Technology 4 (2015), 129--131.

J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. (2019), DS6.

K.M. Koh, D.G. Rogers and T. Tan, Two theorems on graceful trees, Discrete Math. 25 (1979), 141--148.

K.M. Koh, D.G. Rogers and T. Tan, Interlaced trees: a class of graceful trees, in: Combinatorial mathematics VI: Proc. Sixth Australian Conference, Armidale, Lecture Notes in Math. (Springer-Verlag, Berlin, 1979).

K.M. Koh, D.G. Rogers and T. Tan, Products of graceful trees, {it Discrete Math. 31 (1980), 279--292.

K.M. Koh, D.G. Rogers and T. Tan, Another class of graceful trees, J. Austral. Math. Soc. Series A 31 (1981), 226--235.

D. Mishra, S.K. Rout, and P.C. Nayak, Some new graceful generalized classes of diameter six trees, Electron. J. Graph Theory Appl. 5 (2017), 94--111.

R.G. Stanton and C.R. Zarnke, Labeling of balanced trees, in: Proc. Fourth South Eastern Conference, Boca Raton, Congr. Numer. 8 (Utilitas Math., Winnipeg, 1973).


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats