Abstract: Let be a finite plane multigraph and its dual. Each edge of is interpreted as a resistor of resistance , and the dual edge is assigned the dual resistance . Then the equivalent resistance over and the equivalent resistance over satisfy . We provide a graph theoretic proof of this relation by expressing the resistances in terms of sums of weights of spanning trees in and respectively.
Recommendations
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
- Inverses of triangular matrices and bipartite graphs
- Resistor networks based on symmetrical polytopes
- Spanning trees of dual graphs
Cited in
(3)
This page was built for publication: Resistors in dual networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957993)