| 完全二分图的生成树的个数 |
| |
| 引用本文： | 侴万禧,郝朋伟. 完全二分图的生成树的个数[J]. 阜阳师范学院学报(自然科学版), 2008, 25(4): 12-14 |
| |
| 作者姓名： | 侴万禧 郝朋伟 |
| |
| 作者单位： | 1. 安徽理工大学 土木建筑学院
2. 安徽理工大学 理学院力学系,安徽 淮南,232001 |
| |
| 摘 要： | 给出了生成子图的定义．证明了生成子图的构造定理和计数定理．提出了任意G（p，q）的生成树的计数方法和构造方法．介绍了完全二分图K3,3的生成树的计数和构造．
|
| 关 键 词： | 完全二分图 生成树 生成子图 计数 构造 |
Number of Spanning Trees in a Complete Bipartite Graph |
| |
| CHOU Wan-xi,HAO Peng-wei. Number of Spanning Trees in a Complete Bipartite Graph[J]. Journal of Fuyang Teachers College:Natural Science, 2008, 25(4): 12-14 |
| |
| Authors: | CHOU Wan-xi HAO Peng-wei |
| |
| Affiliation: | CHOU Wan-xi, HAO Peng-wei (1. School of Architecture and Civil Engineering; 2. Science Academy, Anhui University of Science and Technology, Huainan, Huainan, Anhui 232001. China) |
| |
| Abstract: | The definition of spanning subgraphs is given.The construction theorem and counting theorem of spanning subgraphs are proved.The counting method and construction method of spanning trees in an arbitrary graph G(p,q) are proposed.The counting and the construction of spanning trees in a complete bipartite graph Km,n are presented. |
| |
| Keywords: | complete bipartite graph spanning tree spanning subgraph counting construction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
