TOPICS
Search

Banana Tree

BananaTree

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of a k-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).

The (n,k)-banana tree has rank polynomial

R(x)=(1+x)^(nk).

Precomputed properties of a number of banana trees are implemented in the Wolfram Language as GraphData[{"BananaTree", {n, k}}].

See also

Caterpillar Graph, Lobster Graph, Star Graph, Tree

Explore with Wolfram|Alpha

References

Chen, W.-C.; Lu, H.-I; and Yeh, Y.-N. "Operations of Interlaced Trees and Graceful Trees." Southeast Asian Bull. Math. 21, 337-348, 1997.Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin., Dynamic Survey DS6, Oct. 30, 2025. https://doi.org/10.37236/27.Horton, M. "Graceful Trees: Statistics and Algorithms." Bachelor of Computing with Honours thesis. Hobart, Tasmania, Australia: University of Tasmania, 2003. https://doi.org/10.25959/23212346.House of Graphs. Banana Trees. T(3,2,2,2,3), Sierpinski Triangle 3 Half Tree, Terdragon Triangle 3 Right Turns, and Most Maximum Matchings Tree 17.Sethuraman, G.; and Jesintha, J. "All Banana Trees Are Graceful." Advances Appl. Disc. Math. 4, 53-64, 2009.

Referenced on Wolfram|Alpha

Banana Tree

Cite this as:

Weisstein, Eric W. "Banana Tree." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BananaTree.html

Subject classifications