Topological formulas for 4-terminal nonreciprocal constraints
Author :
Brown, Kenneth
Volume :
3
Issue :
10
fYear :
1967
fDate :
10/1/1967 12:00:00 AM
Firstpage :
453
Lastpage :
454
Abstract :
Directed-graph partitioning is used to obtain topological formulas, which contain no algebraic or topological redundancies, for the network determinants of nonreciprocal, 4-terminal constraints.
