Advances and Applications in Discrete Mathematics
Volume 4, Issue 1, Pages 53 - 64
(July 2009)
|
|
ALL BANANA TREES ARE GRACEFUL
G. Sethuraman (India) and J. Jeba Jesintha (India)
|
Abstract: A banana tree is a graph obtained by connecting a vertex v to one leaf of each of any number of stars, v is not in any of the stars. In [2], Chen et al. conjectured that all banana trees are graceful. In this paper, we prove that all banana trees are graceful. |
Keywords and phrases: trees, graceful labeling. |
|
Number of Downloads: 258 | Number of Views: 746 |
|