The need to determine the sum of all tree admittance products occurs in almost all applications of topological network theory. This paper describes a method of obtaining this sum through an iterative factorization of the sum of tree admittance products of successively more complex subnetworks. Computational efficiency is achieved in that: (1) it is not necessary to test sets of branches for the presence of circuits; and (2) it is not necessary to calculate each tree admittance product.
A digital computer program has been developed for use on an IBM-704 which accommodates any network with complex branch admittances and up to 14 nodes. Far more complex networks may be analyzed, however, if they are first decomposed into two-terminal subnetworks. A detailed description and flow chart of the program are included.