Abstract :
W. J. Seeley (Duke University, Durham, N. C.): There is available at the present time a mass of excellent literature dealing with bridge networks, the bulk of which, for the most part, being concerned with some particular network or application. It is a rather herculean task, however, to attempt to go through this literature for the purpose of arriving at a general over-all picture of what might be called a parent network, that is, a network of such generality that any particular bridge network might be derived from it as a particular case. A number of papers are available which tend toward such generality. These papers, in general, follow one of two lines of approach, namely, either by means of a generalized network, or else by reducing all possible networks to a classification. Examples of the first method are papers by Kouwenhoven and coauthors and Balsbaugh and coauthors, and of the second method those of Ferguson and Seletzky. What is needed now is a merging of these two methods, together with the one mentioned in the next paragraph, so as to make available a single parent network from which all possible networks may be derived. The development of the present paper falls in the first of the two categories mentioned above and is a distinct forward step toward the derivation of an ideal all-inclusive bridge network. Furthermore, it considerably clarifies the tie-up between network algebra and the required operating technique; that is, it shows distinctly the necessary manipulative procedure required to verify the various balance relations resulting from theoretical deductions, and it is simply done.
