首页> 外文会议>International Conference on Frontiers of Manufacturing and Design Science >Methods of Constructing and Enumerating the Spanning Tree of a Connected Graph
【24h】

Methods of Constructing and Enumerating the Spanning Tree of a Connected Graph

机译:构建和枚举连接图的生成树的方法

获取原文

摘要

A definition concerning the spanning sub graph and spanning sub graph circle is given. Use the enumerating methods of spanning sub circle; seek out the spanning sub graph of spanning trees. The theorems of constructing and enumerating the spanning trees are proved. The methods of enumerating and constructing connected graph spanning tree are proposed. The application examples of construction theorem and enumerating theorem are given the spanning sub graph's number of five plane graph and the construction of Constituent sub-graph are introduced, thus verifying constructing and enumerating theorem are useful and effective. This method Is a Simple and easy method to construct the spanning tree of connected graph.
机译:给出了关于生成子图和生成子图圈的定义。使用跨越子圈的枚举方法;寻找跨越树木的跨越子图。证明了构建和枚举跨越树的定理。提出了枚举和构造连接图跨越树的方法。施工定理和枚举定理的应用示例被赋予跨越子图的五个平面图的数量,并且介绍了构成子图的构造,从而验证构建和枚举定理是有用且有效的。这种方法是构建连接图的生成树的简单且简单的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号