Abstract
A method of generating all complete trees of a pair of linear graphs representing an active network is given. This method is a repetition of two processes, one of which is to obtain a complete tree and the other is to generate all possible complete trees of distance one from the complete tree that is obtained by the first process. These two processes are easily carried out by the use of computers, and there will be no duplications in the generated complete trees. Furthermore, complete trees are generated by sets of complete trees classified by edges in initial complete tree to. Thus, it will be easy to factorize the result according to the weights of these edges.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
