A class of diameter six trees exhibiting graceful labeling. (1st November 2016)

• Record Type: Journal Article
• Authors: Panda, Amaresh Chandra; Mishra, Debdas; Dash, Rajani Ballav
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 5/6(2016)
• Page Start: 947
• Page End: 963
• Publication Date: 2016-11-01
• Subjects: Graceful labeling -- Diameter six tree -- Component moving transformation -- Transfers of the first and second types -- BD8TF; 05C78; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2014.1001591
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A diameter six tree may be represented by a set of vertices, say ( a 0 ; a 1, a 2, . . ., am; b 1, b 2, . . ., b n ; c 1, c 2, . . ., c r ), where a 0 stands for the center of the tree and the vertices a i, i = 1, 2, . . ., m, b j, j = 1, 2, . . ., n, c k, k = 1, 2, . . ., r are adjacent to a 0 . Moreover, each a i is the center of a diameter four tree, each b j is the center of a star, and each c k is a pendant vertex. Observe that in a diameter four tree, the neighbors of the center vertex are either the centers of some stars or pendant vertices. Here we call a star an odd branch if its center has an odd degree and an even branch if its center has an even degree. In the diameter six trees ( a 0 ; a 1, a 2, . . ., a m ; b 1, b 2, . . ., b n ; c 1, c 2, . . ., c r ) to which we give graceful labeling in this paper, each vertex a i, 1 ≤ i ≤ m, has an even degree and it may be adjacent to four different combinations consisting of odd branches, even branches, and pendant vertices.