摘要
给出了生成子图的定义.证明了生成子图的构造定理和计数定理.提出了任意G(p,q)的生成树的计数方法和构造方法.介绍了完全二分图K3,3的生成树的计数和构造.
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.
出处
《阜阳师范学院学报（自然科学版）》
2008年第4期12-14,共3页
Journal of Fuyang Normal University(Natural Science)
关键词
完全二分图
生成树
生成子图
计数
构造
complete bipartite graph
spanning tree
spanning subgraph
counting
construction
