Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The order of complexity of RLC-nullor networks

From MaRDI portal
Publication:1837674
Jump to:navigation, search

DOI10.1007/BF01598146zbMath0507.94023MaRDI QIDQ1837674

J. A. Svoboda

Publication date: 1983

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)


zbMATH Keywords

upper boundRLC-nullor network


Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)


Related Items (3)

The voltage mirror-current mirror pair as a universal element ⋮ Taxicab geometry in table of higher-order elements ⋮ Modified state equations to represent changes in RC-nullor networks



Cites Work

  • On the existence of solutions to linear active networks: A state-space approach


This page was built for publication: The order of complexity of RLC-nullor networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1837674&oldid=14210534"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki