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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.