| 标号完全多部图的非平凡有根支撑森林的计数 |
| |
| 引用本文： | 黄宇飞.标号完全多部图的非平凡有根支撑森林的计数[J].海南师范大学学报(自然科学版),2009,22(2):139-141. |
| |
| 作者姓名： | 黄宇飞 |
| |
| 作者单位： | 华南师范大学,数学科学学院,广州510631 |
| |
| 摘 要： | 文1]中,柳柏濂与黄凤英研究了标号完全二部图的非平凡有根支撑森林的计数问题.在本文中,我们对该问题进行了自然地推广,解决了标号完全多部图的非平凡有根支撑森林的计数问题.进一步地.我们获得了标号完全多部图的包含s个s(≥0)平凡树的有根支撑森林的计数公式.
|
| 关 键 词： | 计数 非平凡森林 完全多部图 |
Counting on No-trivial Rooted Spanning Forests of Labeled Complete Multipartite Graphs |
| |
| HUANG Yufei.Counting on No-trivial Rooted Spanning Forests of Labeled Complete Multipartite Graphs[J].Journal of Hainan Normal University:Natural Science,2009,22(2):139-141. |
| |
| Authors: | HUANG Yufei |
| |
| Abstract: | In 1], B. L. Liu and F. Y. Huang investigated the problem of enumeration for no-trivial rooted spanning forests in a labeled complete bipartite graph. As its natural extension, the problem of enumeration for no-trivial rooted spanning forests of labeled complete muhipartite graphs is settled in this paper. Furthermore, we obtain the equation to count the number of rooted spanning forests with s (≥0) trivial trees of labeled complete muhipartite graphs. |
| |
| Keywords: | Enumeration No-trivial forest Complete multipartite graphs |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
