Javascript must be enabled to continue!
Generalized networks: Networks embedded on a matroid, part I
View through CrossRef
AbstractThe definition of ordinary electric networks is based on graphs. Since such a formulation is inadequate in many respects, we define a new network concept, namely, a generalized network, which is a network based on a matroid. To make the paper self‐contained an introduction to basic matroid theory is given in the first part of the paper. We then define a generalized network and formulate the network analysis and network synthesis problems for generalized networks. A number of new results are obtained for both analysis and synthesis and some old results for networks on graphs are generalized to networks on matroids. It is shown that the principle of duality, which does not hold for networks on graphs but is valid for generalized networks, adds power and insight for solving analysis and synthesis problems. The analysis problem, though formulated in terms of resistance networks, holds for networks containing all types of elements. The synthesis problem that is treated is the crucial one of the realization of a p‐port resistance network.
Title: Generalized networks: Networks embedded on a matroid, part I
Description:
AbstractThe definition of ordinary electric networks is based on graphs.
Since such a formulation is inadequate in many respects, we define a new network concept, namely, a generalized network, which is a network based on a matroid.
To make the paper self‐contained an introduction to basic matroid theory is given in the first part of the paper.
We then define a generalized network and formulate the network analysis and network synthesis problems for generalized networks.
A number of new results are obtained for both analysis and synthesis and some old results for networks on graphs are generalized to networks on matroids.
It is shown that the principle of duality, which does not hold for networks on graphs but is valid for generalized networks, adds power and insight for solving analysis and synthesis problems.
The analysis problem, though formulated in terms of resistance networks, holds for networks containing all types of elements.
The synthesis problem that is treated is the crucial one of the realization of a p‐port resistance network.
Related Results
Covering Cycle Matroid
Covering Cycle Matroid
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based o...
Faster Matroid Partition Algorithms
Faster Matroid Partition Algorithms
In the matroid partitioning problem, we are given
\(k\)
matroids
\(\mathcal{M}_{1}=(V,\mathcal{I}_{1}...
Matroids, Cyclic Flats, and Polyhedra
Matroids, Cyclic Flats, and Polyhedra
<p>Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are able to be efficiently ...
On analogs of Cremona automorphisms for matroid fans
On analogs of Cremona automorphisms for matroid fans
Matroids are combinatorial objects that generalize linear independence. A matroid can be represented geometrically by its Bergman fan and we compare the symmetries of these two obj...
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Topological descriptor is a fixed real number directly attached with the molecular graph to predict the physical and chemical properties of the chemical compound. Gutman and Trinaj...
REVIEWING THE IMPACT OF EMBEDDED SYSTEMS IN MEDICAL DEVICES IN THE USA
REVIEWING THE IMPACT OF EMBEDDED SYSTEMS IN MEDICAL DEVICES IN THE USA
The integration of embedded systems in medical devices has revolutionized the healthcare landscape in the United States, fostering advancements in patient care, diagnostics, and tr...
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids
Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a ...
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
<p>Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chordal graphs of bounded treewidth. Hliněný [25] generalised Courcelle's T...

