G. Sethuraman

28 papers Journal 27Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Radio labeling of biconvex split graphs.
AKCE Int. J. Graphs Comb.
G. Sethuraman, M. Nithya
2021 J jnl
Antimagic labeling of new classes of trees.
AKCE Int. J. Graphs Comb.
G. Sethuraman, K. M. Shermily
2021 J jnl
Decomposition of Complete Graphs into Arbitrary Trees.
Graphs Comb.
G. Sethuraman, V. Murugan
2020 J jnl
-labeling of supersubdivided connected graph plus an edge.
AKCE Int. J. Graphs Comb.
G. Sethuraman, M. Sujasree
2020 J jnl
Binomial trees are graceful.
AKCE Int. J. Graphs Comb.
P. Ragukumar, G. Sethuraman
2020 J jnl
Generating graceful unicyclic graphs from a given forest.
AKCE Int. J. Graphs Comb.
G. Sethuraman, V. Murugan
2020 J jnl
Wirelength of embedding complete multipartite graphs into certain graphs.
Discret. Appl. Math.
R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman
2017 J jnl
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.
G. Sethuraman, P. Ragukumar, Peter J. Slater
2017 J jnl
Construction of an α-labeled tree from a given set of α-labeled trees.
AKCE Int. J. Graphs Comb.
G. Sethuraman, P. Ragukumar
2017 J jnl
Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph.
Ars Comb.
G. Sethuraman, P. Ragukumar
2016 J jnl
Generating Graceful Trees from Caterpillars by Recursive Attachment.
Electron. Notes Discret. Math.
G. Sethuraman, V. Murugan
2016 J jnl
Graceful and Cordial Labeling Of Subdivision Of Graphs.
Electron. Notes Discret. Math.
K. Sankar, G. Sethuraman
2015 J jnl
(2, 1)-Total Labeling of a Class of Subcubic Graphs.
Electron. Notes Discret. Math.
G. Sethuraman, A. Velankanni
2015 J jnl
Cycle Partition of Two-Connected and Two-Edge Connected Graphs.
Math. Comput. Sci.
G. Sethuraman, A. Velankanni, S. Anbarasu, V. Vijayalakshmi
2015 J jnl
Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree.
Electron. Notes Discret. Math.
G. Sethuraman, P. Ragukumar
2013 J jnl
On Graceful And Cordial Labeling Of Shell Graphs.
Ars Comb.
G. Sethuraman, K. Sankar
2012 J jnl
Gracefulness Of A Cycle With Parallel Chords And Parallel P
Ars Comb.
A. Elumalai, G. Sethuraman
2011 J jnl
All Arbitrarily Fixed Generalized Banana Trees Are Graceful.
Math. Comput. Sci.
J. Jeba Jesintha, G. Sethuraman
2011 J jnl
On Graceful And Cordial Labeling Of Shell Graphs.
Ars Comb.
G. Sethuraman, K. Sankar
2009 J jnl
Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.
Ars Comb.
G. Sethuraman, S. Venkatesh
2007 J jnl
A note on the Erdos-Farber-Lovász conjecture.
Discret. Math.
Bill Jackson, G. Sethuraman, Carol A. Whitehead
2007 J jnl
Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs.
Ars Comb.
A. Elumalai, G. Sethuraman
2006 — conf
Descriptional Complexity of Alternating Finite Automata.
DCFS
J. Kavitha, L. Jeganathan, G. Sethuraman
2005 J jnl
Gracefulness of a cycle with parallel P
Australas. J Comb.
G. Sethuraman, A. Elumalai
2005 J jnl
Packing of any set of graphs into a graceful/harmonious/elegant graphs.
Ars Comb.
G. Sethuraman, A. Elumalai
2003 J jnl
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs.
Discret. Math.
G. Sethuraman, P. Selvaraju
2002 J jnl
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial.
Discret. Math.
G. Sethuraman, P. Selvaraju
2000 J jnl
Graceful numbering of an edge-gluing of shell graphs.
Discret. Math.
G. Sethuraman, R. Dhavamani