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 incomplete...Show MoreMetadata
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].
Published in: IEEE Transactions on Circuit Theory ( Volume: 13, Issue: 3, September 1966)