混合图有向树集直积生成

Direct product generation of composite graph's directed tree set

将混合图G分解成二分图G(v1)和G(v2 )以及离集Ec,分别生成二分图G(v1)和G(v2 )的k-树集 (k=1,2 ,… ,m) ,并给出了消除伪树的方法 .在此基础上 ,应用直积运算原理建立了生成混合图全部有向树的二分图公式 .该方法具有较好的系统性和直观性 ,并且无伪树成分 ,应用该方法可以生成二分图G(v1)和G(v2 )的有向k -树集 ,并能扩大计算机所能拓扑分析的电网络规模 .

A composite graph G will be separated to bipartite graph G(v\-1),G(v\-2) and separated set E\-c,then k_tree set (k=1,2,...,m) for bipartite G(v\-1) and G(v\-2) is found respectively. And the method of eliminating pseudo_tree is presented. Base on above, applying direct product operation principle to build formula for finding all composite graph directed_tree's bipartite graph. This method has better systematization and straightforwardness than others, even more, it has no pseudo tree component. Applying this method can find the directed k_ tree set of bipartite G(v\-1) and G(v\-2) and can expand electrical network scale of computer topological analysis.