On Graceful Labelings of Trees

Aryabhatta, Sourabh; Roy, Tonmoy; Uddin, Md. Mohsin; Rahman, Md. Saidur

doi:10.1007/978-3-642-19094-0_22

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2021

Publication Types

Select...

Other2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem is one of the most researched problem as there have been more than 500 paper on this in the last 50 years. This conjecture has been tried with mostly two ways which are: newer classes of trees are proved to be graceful(see [3], [4], [5], [6]) or devise a common programming model for generating graceful labels.…”

Section: Introductionmentioning

confidence: 99%

Graceful labeling of trees: Methods and applications

Aziz

Hossain

Faequa

et al. 2014

2014 17th International Conference on Computer and Information Technology (ICCIT)

View full text Add to dashboard Cite

Any tree with n vertices is conjectured to be graceful if its vertices can be labeled using integers 0, 1, · · · , n − 1 such that each vertex label as well as the corresponding edge label is distinct throughout the tree. There has been multiple attempts with different approaches to prove this conjecture but it remains the same. Here we will discuss the methods used to solve this problem along with two new classes of graceful tree and some applications of it.

show abstract

Section: Introductionmentioning

confidence: 99%