中文摘要：

边不交生成树的研究在互连网络并行广播通讯中具有重要的理论意义和应用价值。设Г（Q）为超立方体Qn中以v0为根节点的全体边不交生成树的集合，本文主要讨论｜Г（Qn）｜的上界和下界，得到下列结果：（1）｜Г（Qn）｜≤└n·2^n-1/2^n-1┘,（2）当n≥4时，｜Г（Qn）｜≥2。这些结果为设计超立方体互连网络中并行广播路由算法提供了理论依据。

英文摘要：

For the parallel broadcast communication in interconnection networks, the research of edge-disjoint spanning trees is full of theoretical significance and application value. Let Г（Qn） be a set of all edgedisjoint spanning trees rooted by node v0 in n-dimensional hypercubes,in this paper, we discuss the upper and lower bound on the number of edge-disjoint spanning trees in n-dimensional hypercubes Qn and obtain the following results,（1）｜Г（Qn）｜≤└n·2^n-1/2^n-1┘, （2） ｜Г（Qn）｜≥2,for n≥4. These results provide a theo- retical basis for designing parallel broadcast routing algorithm in the hypercube interconnected networks.