Binomial trees are graceful. Issue 1 (2nd January 2020)

• Record Type: Journal Article
• Authors: Ragukumar, P.; Sethuraman, G.
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 17:Issue 1(2020)
• Page Start: 632
• Page End: 636
• Publication Date: 2020-01-02
• Subjects: Graceful Tree -- Graceful Tree Conjecture -- Binomial tree
• DOI: 10.1016/j.akcej.2018.06.005
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: The binomial tree B 0 consists of a single vertex. The binomial tree B k is an ordered tree defined recursively. The binomial tree B k consists of two binomial trees B k − 1 that are linked together: the root of one is the leftmost child of the root of the other. The popular Graceful Tree Conjecture states that every tree is graceful. In this paper, we show that binomial trees B k is graceful for every k ≥ 0 .