DocumentCode
1163766
Title
Generation of Complete Trees
Author
Mayeda, Wataru ; Hakimi, Seifollah Louis ; Chen, Wai-Kai ; Deo, Narsingh
Volume
15
Issue
2
fYear
1968
fDate
6/1/1968 12:00:00 AM
Firstpage
101
Lastpage
105
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.
Keywords
Active networks; Graph theory; Trees; Admittance; Classification tree analysis; Computer networks; Contracts; Electronics industry; Equations; Laboratories; Propulsion; Transformers; Tree graphs;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1968.1082784
Filename
1082784
Link To Document