default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. Sethuraman 0001
Person information
- affiliation: Anna University, Department of Mathematics, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j26]G. Sethuraman, K. M. Shermily:
Antimagic labeling of new classes of trees. AKCE Int. J. Graphs Comb. 18(2): 110-116 (2021)- [j25]G. Sethuraman
, V. Murugan:
Decomposition of Complete Graphs into Arbitrary Trees. Graphs Comb. 37(4): 1191-1203 (2021) - 2020
- [j24]G. Sethuraman, M. Sujasree:
-labeling of supersubdivided connected graph plus an edge. AKCE Int. J. Graphs Comb. 17(1): 174-183 (2020) - [j23]G. Sethuraman, V. Murugan:
Generating graceful unicyclic graphs from a given forest. AKCE Int. J. Graphs Comb. 17(1): 592-605 (2020) - [j22]P. Ragukumar, G. Sethuraman:
Binomial trees are graceful. AKCE Int. J. Graphs Comb. 17(1): 632-636 (2020) - [j21]R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman:
Wirelength of embedding complete multipartite graphs into certain graphs. Discret. Appl. Math. 280: 221-236 (2020)
2010 – 2019
- 2017
- [j20]G. Sethuraman, P. Ragukumar:
Construction of an α-labeled tree from a given set of α-labeled trees. AKCE Int. J. Graphs Comb. 14(2): 118-129 (2017) - [j19]G. Sethuraman, P. Ragukumar:
Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph. Ars Comb. 132: 27-47 (2017) - [j18]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): 96-106 (2017) - 2016
- [j17]K. Sankar, G. Sethuraman:
Graceful and Cordial Labeling Of Subdivision Of Graphs. Electron. Notes Discret. Math. 53: 123-131 (2016) - [j16]G. Sethuraman, V. Murugan:
Generating Graceful Trees from Caterpillars by Recursive Attachment. Electron. Notes Discret. Math. 53: 133-147 (2016) - 2015
- [j15]G. Sethuraman, P. Ragukumar:
Towards Optimal Embedding of an Arbitrary Tree in a Graceful Tree. Electron. Notes Discret. Math. 48: 73-80 (2015) - [j14]G. Sethuraman, A. Velankanni:
(2, 1)-Total Labeling of a Class of Subcubic Graphs. Electron. Notes Discret. Math. 48: 259-266 (2015) - [j13]G. Sethuraman, A. Velankanni, S. Anbarasu, V. Vijayalakshmi:
Cycle Partition of Two-Connected and Two-Edge Connected Graphs. Math. Comput. Sci. 9(2): 249-252 (2015) - 2013
- [j12]G. Sethuraman, K. Sankar:
On Graceful And Cordial Labeling Of Shell Graphs. Ars Comb. 108: 515-532 (2013) - 2012
- [j11]A. Elumalai, G. Sethuraman:
Gracefulness Of A Cycle With Parallel Chords And Parallel Pk-Chords Of Different Lengths. Ars Comb. 104: 143-148 (2012) - 2011
- [j10]G. Sethuraman, K. Sankar:
On Graceful And Cordial Labeling Of Shell Graphs. Ars Comb. 99: 225-242 (2011) - [j9]J. Jeba Jesintha, G. Sethuraman:
All Arbitrarily Fixed Generalized Banana Trees Are Graceful. Math. Comput. Sci. 5(1): 51-62 (2011)
2000 – 2009
- 2009
- [j8]G. Sethuraman, S. Venkatesh:
Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees. Ars Comb. 93 (2009) - 2007
- [j7]A. Elumalai, G. Sethuraman:
Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs. Ars Comb. 85 (2007) - [j6]Bill Jackson, G. Sethuraman, Carol A. Whitehead:
A note on the Erdos-Farber-Lovász conjecture. Discret. Math. 307(7-8): 911-915 (2007) - 2006
- [c1]J. Kavitha, L. Jeganathan, G. Sethuraman:
Descriptional Complexity of Alternating Finite Automata. DCFS 2006: 188-198 - 2005
- [j5]G. Sethuraman, A. Elumalai:
Gracefulness of a cycle with parallel Pk-chords. Australas. J Comb. 32: 205-212 (2005) - [j4]G. Sethuraman, A. Elumalai:
Packing of any set of graphs into a graceful/harmonious/elegant graphs. Ars Comb. 76 (2005) - 2003
- [j3]G. Sethuraman, P. Selvaraju:
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs. Discret. Math. 260(1-3): 137-149 (2003) - 2002
- [j2]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): 343-350 (2002) - 2000
- [j1]G. Sethuraman, R. Dhavamani:
Graceful numbering of an edge-gluing of shell graphs. Discret. Math. 218(1-3): 283-287 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
