关于最小生成树问题的注记

A note on minimal spanning tree problem

在这篇文章中我们得到在图G=(V,E)

In this paper we get seeking all minimal spanning trees of a graph G=(V,E) in the spanning subgraph G_1= (V, H^+) of G, where H^+={e|W(e)= i, e∈ E,i∈H}, and give a formula of number of all minimal spanning trees, that is|个(G)≤n.