并基于超图模型提出同步无线传感器网络最小生成超树路由算法，以建立数据汇聚的最小能耗树。

Based on the hypergraph model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sen.

youdao

本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。

In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.

youdao