G. Sethuraman

According to our database1, G. Sethuraman authored at least 21 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Wirelength of embedding complete multipartite graphs into certain graphs.
Discret. Appl. Math., 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.
Discret. Math., 2017

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

Construction of an α-labeled tree from a given set of α-labeled trees.
AKCE Int. J. Graphs Comb., 2017

2016
Generating Graceful Trees from Caterpillars by Recursive Attachment.
Electron. Notes Discret. Math., 2016

Graceful and Cordial Labeling Of Subdivision Of Graphs.
Electron. Notes Discret. Math., 2016

2015
Cycle Partition of Two-Connected and Two-Edge Connected Graphs.
Math. Comput. Sci., 2015

(2, 1)-Total Labeling of a Class of Subcubic Graphs.
Electron. Notes Discret. Math., 2015

Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree.
Electron. Notes Discret. Math., 2015

2012
Gracefulness Of A Cycle With Parallel Chords And Parallel P<sub>k</sub>-Chords Of Different Lengths.
Ars Comb., 2012

2011
All Arbitrarily Fixed Generalized Banana Trees Are Graceful.
Math. Comput. Sci., 2011

On Graceful And Cordial Labeling Of Shell Graphs.
Ars Comb., 2011

2009
Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.
Ars Comb., 2009

2007
A note on the Erdos-Farber-Lovász conjecture.
Discret. Math., 2007

Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs.
Ars Comb., 2007

2006
Descriptional Complexity of Alternating Finite Automata.
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.
Ars Comb., 2005

Gracefulness of a cycle with parallel P<sub>k</sub>-chords.
Australas. J Comb., 2005

2003
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs.
Discret. Math., 2003

2002
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial.
Discret. Math., 2002

2000
Graceful numbering of an edge-gluing of shell graphs.
Discret. Math., 2000


  Loading...