Unique solvability and order of complexity of linear networks containing memorylessn-ports
From MaRDI portal
Publication:4178929
DOI10.1002/cta.4490070105zbMath0395.94035MaRDI QIDQ4178929
Publication date: 1979
Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cta.4490070105
Unique Solvability; Electric Networks; Linear Networks; Matroid Partition Algorithms; Memoryless N-Ports; Order of Complexity
94C05: Analytic circuit theory
05B35: Combinatorial aspects of matroids and geometric lattices
94C30: Applications of design theory to circuits and networks
94C15: Applications of graph theory to circuits and networks
Related Items
Extension of the normal tree method, A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection, Network theory and transversal matroids, On the sum of matroids. III, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
Cites Work