根據 Chen et al. (1997) 的定義，
-香蕉樹是透過將 
份 
-星圖 的每個葉子連線到一個與所有星圖都不同的單根頂點而獲得的圖。
香蕉樹是優美的 (Sethuraman and J. Jesintha 2009, Gallian 2018)。
-香蕉樹具有秩多項式
 |
許多香蕉樹的預計算屬性在 Wolfram Language 中實現為GraphData[
"BananaTree", 
n, k
].
香蕉樹
另請參閱
毛毛蟲圖, 龍蝦圖, 星圖, 樹使用 探索
參考文獻
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. DS6. Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.Horton, M. "Graceful Trees: Statistics and Algorithms." Bachelor of Computing with Honours thesis. University of Tasmania, 2003. https://eprints.utas.edu.au/19/1/GracefulTreesStatisticsAndAlgorithms.pdf.Sethuraman, G.; and Jesintha, J. "All Banana Trees Are Graceful." Advances Appl. Disc. Math. 4, 53-64, 2009.在 上引用
香蕉樹請引用為
Weisstein, Eric W. "香蕉樹。" 來自 Web 資源。 https://mathworld.tw/BananaTree.html