Abstract
Consider a linear network composed of 2-terminal devices. Its interconnection structure is described by a graph G. The voltages or the currents of a subset of devices can independently be prescribed if and only if the subset of the corresponding edges in the graph G is circuit-free or cut set free, respectively. This classical result of Kirchhoff can be generalized for networks containing multiterminal devices as well: the independence structure can be described by the circuits and cut sets of a more general abstract mathematical structure, a matroid M. However, these matroids will not always be graphic. Using some recent mathematical results for characterizing graphic structures among the matroids, here we give a physical characterization of subclasses of those active networks where M happens to be graphic.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Periodica Polytechnica Electrical Engineering and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
