Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
From MaRDI portal
Publication:3866022
DOI10.1002/cta.4490080203zbMath0428.94018MaRDI QIDQ3866022
Publication date: 1980
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.4490080203
matroid parity problem; normal tree; memoryless two-ports; RLC elements; unique solvability of linear networks
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, A constrained independent set problem for matroids, Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
Cites Work