Premium
On the properties of directed switching networks
Author(s) -
Wu MinYou,
Chan ShuPark
Publication year - 1987
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230170206
Subject(s) - directed graph , path (computing) , computer science , subtraction , matrix (chemical analysis) , rank (graph theory) , mathematics , topology (electrical circuits) , arithmetic , combinatorics , algorithm , computer network , materials science , composite material
The theory of directed switching networks is developed. After the fundamental concepts are defined, the rank of the path matrix of a Directed Single‐Contact (Di‐SC) network is discussed. The theorem which gives the essential relationship between the SC and Di‐SC networks is proved. Then the Odd‐Addition‐Subtraction (OAS) condition is given as a necessary condition for Di‐SC functions. The analysis of directed switching networks and the synthesis of Di‐SC networks are also given for practical applications. The results could be used in the design of electrical and computer systems with directed elements.