Graceful numbering of an edge-gluing of shell graphs. - G. Sethuraman 001; R. Dhavamani (Discret. Math., 2000)

One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial. - G. Sethuraman 001; P. Selvaraju (Discret. Math., 2002)

Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs. - G. Sethuraman 001; P. Selvaraju (Discret. Math., 2003)

Gracefulness of a cycle with parallel Pk-chords. - G. Sethuraman 001; A. Elumalai (Australas. J Comb., 2005)

Packing of any set of graphs into a graceful/harmonious/elegant graphs. - G. Sethuraman 001; A. Elumalai (Ars Comb., 2005)

Descriptional Complexity of Alternating Finite Automata. - J. Kavitha; L. Jeganathan; G. Sethuraman 001 (DCFS, 2006)

Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs. - A. Elumalai; G. Sethuraman 001 (Ars Comb., 2007)

A note on the Erdos-Farber-Lovász conjecture. - Bill Jackson; G. Sethuraman 001; Carol A. Whitehead (Discret. Math., 2007)

Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees. - G. Sethuraman 001; S. Venkatesh (Ars Comb., 2009)

All Arbitrarily Fixed Generalized Banana Trees Are Graceful. - J. Jeba Jesintha; G. Sethuraman 001 (Math. Comput. Sci., 2011)

Gracefulness Of A Cycle With Parallel Chords And Parallel Pk-Chords Of Different Lengths. - A. Elumalai; G. Sethuraman 001 (Ars Comb., 2012)

On Graceful And Cordial Labeling Of Shell Graphs. - G. Sethuraman 001; K. Sankar (Ars Comb., 2013)

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

(2, 1)-Total Labeling of a Class of Subcubic Graphs. - G. Sethuraman 001; A. Velankanni (Electron. Notes Discret. Math., 2015)

Cycle Partition of Two-Connected and Two-Edge Connected Graphs. - G. Sethuraman 001; A. Velankanni; S. Anbarasu; V. Vijayalakshmi 002 (Math. Comput. Sci., 2015)

Graceful and Cordial Labeling Of Subdivision Of Graphs. - K. Sankar; G. Sethuraman 001 (Electron. Notes Discret. Math., 2016)

Generating Graceful Trees from Caterpillars by Recursive Attachment. - G. Sethuraman 001; V. Murugan (Electron. Notes Discret. Math., 2016)

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)

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

Generating graceful unicyclic graphs from a given forest. - G. Sethuraman 001; V. Murugan (AKCE Int. J. Graphs Comb., 2020)

-labeling of supersubdivided connected graph plus an edge. - G. Sethuraman 001; M. Sujasree (AKCE Int. J. Graphs Comb., 2020)

Wirelength of embedding complete multipartite graphs into certain graphs. - R. Sundara Rajan; T. M. Rajalaxmi; Jia-Bao Liu; G. Sethuraman 001 (Discret. Appl. Math., 2020)

Antimagic labeling of new classes of trees. - G. Sethuraman 001; K. M. Shermily (AKCE Int. J. Graphs Comb., 2021)

Decomposition of Complete Graphs into Arbitrary Trees. - G. Sethuraman 001; V. Murugan (Graphs Comb., 2021)

Radio labeling of biconvex split graphs. - G. Sethuraman 001; M. Nithya (AKCE Int. J. Graphs Comb., 2025)