Number of Trees in a Cascade of 2-Port Networks
- 1 September 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 14 (3) , 284-290
- https://doi.org/10.1109/TCT.1967.1082708
Abstract
Recurrence formulas for the numbers of trees, port terminal-pair 2-trees, and terminal 3-trees in a cascade of nonidentical 2-port networks are presented in this paper. They are derived from counting series which provide a clear insight, not apparent from the recurrence formulas themselves, into the composition of the various tree structures. These formulas and series reduce readily to the simpler forms which pertain when the networks in the cascade are identical, confirming certain recurrence formulas presented previously by Gruszczynski for this special case.Keywords
This publication has 4 references indexed in Scilit:
- Comment on "Number of Trees in a Chain of Identical GraphsIEEE Transactions on Circuit Theory, 1966
- The Number of Trees in a NetworkIEEE Transactions on Circuit Theory, 1966
- Number of Trees in a Chain of Identical GraphsIEEE Transactions on Circuit Theory, 1966
- Ladder-Network Analysis Using Fibonacci NumbersIRE Transactions on Circuit Theory, 1959