Matrix Analysis of Oriented Graphs with Irreducible Feedback Loops
- 1 June 1955
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IRE Transactions on Circuit Theory
- Vol. 2 (2) , 117-127
- https://doi.org/10.1109/tct.1955.1085228
Abstract
THE PROBLEM of determining the possible I closed circuits available in a situation in which n terminals are interconnected in some fashion by unilateral branches is one of considerable importance in a number of diverse fields. It may be regarded as that of a topological characterization of a linear network, with specific branch gains between terminals; in such a case, the system may be designated (see Fig. 1) by the branch gain or transmission factor matrix A = (aij), in terms of which the terminal inputs Ei and terminal ¿voltages¿ Vi are related byKeywords
This publication has 4 references indexed in Scilit:
- Feedback Theory-Some Properties of Signal Flow GraphsProceedings of the IRE, 1953
- Two Decomposition Theorems for a Class of Finite Oriented GraphsAmerican Journal of Mathematics, 1952
- The Theory of PositronsPhysical Review B, 1949
- A method of matrix analysis of group structurePsychometrika, 1949