Title :
The Number of Trees in a Network
Author :
O´Neil, P.V. ; Slepian, P.
fDate :
9/1/1966 12:00:00 AM
Abstract :
In this paper we exhibit an explicit formula for the number of trees in a certain type of network. In particular, we define, in Definition 3, the concept of an incompletely partitioned network, and offer in Theorem 9 a formula for the number of trees of an incompletely partitioned network. Our formulas include, as special cases, the formulas exhibited previously in the literature by Weinberg [1] and Bedrosian [2].
Keywords :
Circuit synthesis; Circuit theory; Circuits and systems; Eigenvalues and eigenfunctions; Joining processes; Mathematics; National electric code; Network synthesis; Passive networks; Tree graphs;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1966.1082611
