香蕉树

根据 Chen et al. (1997) 的定义，-香蕉树是通过将份 -星图的每个叶子连接到一个与所有星图都不同的单根顶点而获得的图。

香蕉树是优美的 (Sethuraman and J. Jesintha 2009, Gallian 2018)。

-香蕉树具有秩多项式

许多香蕉树的预计算属性在 Wolfram Language 中实现为GraphData["BananaTree", n, k].

另请参阅

毛毛虫图, 龙虾图, 星图, 树

使用 Wolfram|Alpha 探索

更多尝试

参考文献

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.

在 Wolfram|Alpha 上引用

香蕉树

请引用为

Weisstein, Eric W. "香蕉树。" 来自 MathWorld--Wolfram Web 资源。 https://mathworld.net.cn/BananaTree.html