Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports

DOI10.1002/cta.4490080203zbMath0428.94018OpenAlexW1989990976MaRDI QIDQ3866022

András Recski

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

zbMATH Keywords

matroid parity problemnormal treememoryless two-portsRLC elementsunique solvability of linear networks

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Applications of design theory to circuits and networks (94C30) Applications of graph theory to circuits and networks (94C15)

Related Items

Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—, Network theory and transversal matroids, A constrained independent set problem for matroids, Extension of the normal tree method, A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection

Cites Work

• Unnamed Item
• Unnamed Item