G. Sethuraman

According to our database, G. Sethuraman authored at least 26 papers between 2000 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Decomposition of Complete Graphs into Arbitrary Trees.

G. Sethuraman, V. Murugan

Graphs Comb., 2021

Antimagic labeling of new classes of trees.

G. Sethuraman, K. M. Shermily

AKCE Int. J. Graphs Comb., 2021

2020

Wirelength of embedding complete multipartite graphs into certain graphs.

R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman

Discret. Appl. Math., 2020

-labeling of supersubdivided connected graph plus an edge.

G. Sethuraman, M. Sujasree

AKCE Int. J. Graphs Comb., 2020

Generating graceful unicyclic graphs from a given forest.

G. Sethuraman, V. Murugan

AKCE Int. J. Graphs Comb., 2020

Binomial trees are graceful.

P. Ragukumar, G. Sethuraman

AKCE Int. J. Graphs Comb., 2020

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, P. Ragukumar, Peter J. Slater

Discret. Math., 2017

Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph.

G. Sethuraman, P. Ragukumar

Ars Comb., 2017

Construction of an α-labeled tree from a given set of α-labeled trees.

G. Sethuraman, P. Ragukumar

AKCE Int. J. Graphs Comb., 2017

2016

Generating Graceful Trees from Caterpillars by Recursive Attachment.

G. Sethuraman, V. Murugan

Electron. Notes Discret. Math., 2016

Graceful and Cordial Labeling Of Subdivision Of Graphs.

K. Sankar, G. Sethuraman

Electron. Notes Discret. Math., 2016

2015

Cycle Partition of Two-Connected and Two-Edge Connected Graphs.

G. Sethuraman, A. Velankanni, S. Anbarasu, V. Vijayalakshmi

Math. Comput. Sci., 2015

(2, 1)-Total Labeling of a Class of Subcubic Graphs.

G. Sethuraman, A. Velankanni

Electron. Notes Discret. Math., 2015

Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree.

G. Sethuraman, P. Ragukumar

Electron. Notes Discret. Math., 2015

2013

On Graceful And Cordial Labeling Of Shell Graphs.

G. Sethuraman, K. Sankar

Ars Comb., 2013

2012

Gracefulness Of A Cycle With Parallel Chords And Parallel P_k-Chords Of Different Lengths.

A. Elumalai, G. Sethuraman

Ars Comb., 2012

2011

All Arbitrarily Fixed Generalized Banana Trees Are Graceful.

J. Jeba Jesintha, G. Sethuraman

Math. Comput. Sci., 2011

2009

Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.

G. Sethuraman, S. Venkatesh

Ars Comb., 2009

2007

A note on the Erdos-Farber-Lovász conjecture.

Bill Jackson, G. Sethuraman, Carol A. Whitehead

Discret. Math., 2007

Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs.

A. Elumalai, G. Sethuraman

Ars Comb., 2007

2006

Descriptional Complexity of Alternating Finite Automata.

J. Kavitha, L. Jeganathan, G. Sethuraman

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Packing of any set of graphs into a graceful/harmonious/elegant graphs.

G. Sethuraman, A. Elumalai

Ars Comb., 2005

Gracefulness of a cycle with parallel P_k-chords.

G. Sethuraman, A. Elumalai

Australas. J Comb., 2005

2003

Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs.

G. Sethuraman, P. Selvaraju

Discret. Math., 2003

2002

One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial.

G. Sethuraman, P. Selvaraju

Discret. Math., 2002

2000

Graceful numbering of an edge-gluing of shell graphs.

G. Sethuraman, R. Dhavamani

Discret. Math., 2000