Computer Generation of Trees and Co-Trees in a Cascade of Multiterminal Networks

Generation formulas are presented from which the sets of trees or co-trees in a cascade of arbitrary multiterminal networks that do not contain mutual couplings are given in terms of the ring sums or unions of the Cartesian products of the sets of subgraphs of the component networks. If the subgraphs of the component networks are given, the procedure will not generate any duplications, redundancies, or cancellations of terms. Illustrative examples are also given.