Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree. - G. Sethuraman 001; P. Ragukumar (Electron. Notes Discret. Math., 2015)

Construction of an α-labeled tree from a given set of α-labeled trees. - G. Sethuraman 001; P. Ragukumar (AKCE Int. J. Graphs Comb., 2017)

Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph. - G. Sethuraman 001; P. Ragukumar (Ars Comb., 2017)

Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. - G. Sethuraman 001; P. Ragukumar; Peter J. Slater (Discret. Math., 2017)

Harmonious coloring: Parameterized algorithms and upper bounds. - Sudeshna Kolay; Ragukumar Pandurangan; Fahad Panolan; Venkatesh Raman 001; Prafullkumar Tale (Theor. Comput. Sci., 2019)

Binomial trees are graceful. - P. Ragukumar; G. Sethuraman 001 (AKCE Int. J. Graphs Comb., 2020)