| 335 | 4 | 33 |
| 下载次数 | 被引频次 | 阅读次数 |
给出了生成子图的定义.证明了生成子图的构造定理和计数定理.提出了任意G(p,q)的生成树的计数方法和构造方法.介绍了完全二分图K3,3的生成树的计数和构造.
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.
[1]Bela Bollobas.Graph theary[M].New York:Springer Verlag,1973.
[2]Fred S,Roberts,Barry Tesman.Applied Combinatorics[M].New York:Prentice Hall,2005.
[3]Kelmans A K.The number of trees in agraph[J].I.Automat.Romote Control,1965,(26):2 118-2 179.
[4]Beth T,Jangnickel D,Lenz H.Design Theory[M].New York:Combridge University Pres,1997.
基本信息:
中图分类号:O157.5
引用信息:
[1]万禧,郝朋伟.完全二分图的生成树的个数[J].阜阳师范学院学报(自然科学版),2008,25(04):12-14.
2008-12-16
2008-12-16