Skip to Main Content
Techniques of linear graph theory are applied to the study of switching networks. The first part treats the relationships among paths and circuits in a graph which will give a simple method of analyzing switching networks. The necessary conditions are given for the realizability of switching networks consisting of the specified elements. The second part is the synthesis which is accomplished by the use of the decomposition of cut-set matrices.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.