G. Sethuraman

Publication Activity (10 Years)

Years Active: 2000-2021
Publications (10 Years): 11

Top Topics

Chord Progressions

Connected Graphs

Top Venues

AKCE Int. J. Graphs Comb.

Electron. Notes Discret. Math.

Math. Comput. Sci.

Publications

G. Sethuraman, K. M. Shermily
Antimagic labeling of new classes of trees. AKCE Int. J. Graphs Comb. 18 (2) (2021)
G. Sethuraman, V. Murugan
Decomposition of Complete Graphs into Arbitrary Trees. Graphs Comb. 37 (4) (2021)
G. Sethuraman, M. Sujasree
-labeling of supersubdivided connected graph plus an edge. AKCE Int. J. Graphs Comb. 17 (1) (2020)
G. Sethuraman, V. Murugan
Generating graceful unicyclic graphs from a given forest. AKCE Int. J. Graphs Comb. 17 (1) (2020)
R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman
Wirelength of embedding complete multipartite graphs into certain graphs. Discret. Appl. Math. 280 (2020)
P. Ragukumar, G. Sethuraman
Binomial trees are graceful. AKCE Int. J. Graphs Comb. 17 (1) (2020)
G. Sethuraman, P. Ragukumar
Construction of an α-labeled tree from a given set of α-labeled trees. AKCE Int. J. Graphs Comb. 14 (2) (2017)
G. Sethuraman, P. Ragukumar
Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph. Ars Comb. 132 (2017)
G. Sethuraman, P. Ragukumar, Peter J. Slater
Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. Discret. Math. 340 (2) (2017)
G. Sethuraman, V. Murugan
Generating Graceful Trees from Caterpillars by Recursive Attachment. Electron. Notes Discret. Math. 53 (2016)
K. Sankar, G. Sethuraman
Graceful and Cordial Labeling Of Subdivision Of Graphs. Electron. Notes Discret. Math. 53 (2016)
G. Sethuraman, A. Velankanni, S. Anbarasu, V. Vijayalakshmi
Cycle Partition of Two-Connected and Two-Edge Connected Graphs. Math. Comput. Sci. 9 (2) (2015)
G. Sethuraman, A. Velankanni
(2, 1)-Total Labeling of a Class of Subcubic Graphs. Electron. Notes Discret. Math. 48 (2015)
G. Sethuraman, P. Ragukumar
Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree. Electron. Notes Discret. Math. 48 (2015)
G. Sethuraman, K. Sankar
On Graceful And Cordial Labeling Of Shell Graphs. Ars Comb. 108 (2013)
A. Elumalai, G. Sethuraman
-Chords Of Different Lengths. Ars Comb. 104 (2012)
J. Jeba Jesintha, G. Sethuraman
All Arbitrarily Fixed Generalized Banana Trees Are Graceful. Math. Comput. Sci. 5 (1) (2011)
G. Sethuraman, K. Sankar
On Graceful And Cordial Labeling Of Shell Graphs. Ars Comb. 99 (2011)
G. Sethuraman, S. Venkatesh
Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees. Ars Comb. 93 (2009)
A. Elumalai, G. Sethuraman
Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs. Ars Comb. 85 (2007)
Bill Jackson, G. Sethuraman, Carol A. Whitehead
A note on the Erdos-Farber-Lovász conjecture. Discret. Math. 307 (7-8) (2007)
J. Kavitha, L. Jeganathan, G. Sethuraman
Descriptional Complexity of Alternating Finite Automata. DCFS (2006)
G. Sethuraman, A. Elumalai
Packing of any set of graphs into a graceful/harmonious/elegant graphs. Ars Comb. 76 (2005)
G. Sethuraman, A. Elumalai
-chords. Australas. J Comb. 32 (2005)
G. Sethuraman, P. Selvaraju
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs. Discret. Math. 260 (1-3) (2003)
G. Sethuraman, P. Selvaraju
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial. Discret. Math. 259 (1-3) (2002)
G. Sethuraman, R. Dhavamani
Graceful numbering of an edge-gluing of shell graphs. Discret. Math. 218 (1-3) (2000)