Construction of an α-labeled tree from a given set of α-labeled trees. Issue 2 (1st August 2017)

• Record Type: Journal Article
• Authors: Sethuraman, G.; Ragukumar, P.
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 14:Issue 2(2017)
• Page Start: 118
• Page End: 129
• Publication Date: 2017-08-01
• Subjects: Graceful tree -- Graceful tree conjecture -- Graceful labeling
• DOI: 10.1016/j.akcej.2017.01.004
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of k known graceful trees, k ≥ 2 in a specific way. In fact, each member of this new class of trees admits α -labeling, a stronger version of graceful labeling. Consequently, each member of this family of trees decomposes complete graphs and complete bipartite graphs.