An -banana tree, as defined by Chen
et al. (1997), is a graph obtained by connecting one leaf of each of copies of an -star graph with a single root
vertex that is distinct from all the stars.
Banana trees are graceful (Sethuraman and J. Jesintha
2009, Gallian 2018).
-banana tree, as defined by Chen
et al. (1997), is a graph obtained by connecting one leaf of each of 
copies of an 
-star graph with a single root
vertex that is distinct from all the stars.
-banana tree has rank
polynomial
"BananaTree", 
n, k
].
