摘要
在工程实际中,经常要设计最短线路或管线,这往往要用到生成树的知识。本文给出了生成子图的定义,证明了生成子图的计数定理和构造定理,提出了任意G(p,q)的生成树的构造方法和技术方法。介绍了八面体平面的生成树的计数和构造。
The definition of spanning subgraphs is given.The counting theorem and construction theorem of spanning subgraphs are proved. The methods of both counting and constructing spanning trees in a arbitrary graph G （p,q） are proposed~ .The counting and construction of spanning trees in a plan of octahedron are presented.
出处
《科技视界》
2013年第23期104-105,共2页
Science & Technology Vision
关键词
生成子图
生成树
构造
计数
Counting
Construction
Spanning tree
Theorem
Spanning subgraph
