摘要
给出了生成子图的定义。证明了生成子图的计数定理和构造定理。提出了生成树的计数方法和构造方法。介绍了完全图K6的含圈的生成子图和不含圈的生成树的计数与构造。
The definition of spanning subgraphs is given. The counting theorem and constraction theorem of spanning subgraphs are proved. The counting method and construction method of spanning trees are proposed. The counting and the construction of spanning subgraphs with cycle and a cyclic spanning trees in a complete graph Kp are presented.
出处
《沈阳师范大学学报（自然科学版）》
CAS
2009年第2期134-136,共3页
Journal of Shenyang Normal University:Natural Science Edition
基金
国家自然科学基金资助项目(10471096)
关键词
完全图
生成树
计数
构造
偶阶
complete graph
spanning tree
counting
constraction
even order
