P. Ragukumar

According to our database, P. Ragukumar authored at least 5 papers between 2015 and 2020.

Collaborative distances:

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

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

2015

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

G. Sethuraman, P. Ragukumar

Electron. Notes Discret. Math., 2015