Direct product generation of composite graph's directed tree set
Xiong Yuan · 2001
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.