Resistors in dual networks
DOI10.5614/EJGTA.2020.8.2.6zbMATH Open1468.05032arXiv1805.01380OpenAlexW3094786396MaRDI QIDQ4957993FDOQ4957993
Authors: Martina Furrer, Simon Jantschgi, Norbert Hungerbühler
Publication date: 6 September 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.01380
Recommendations
Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Determinants, permanents, traces, other special matrix functions (15A15) Distance in graphs (05C12)
Cites Work
- Spanning trees of dual graphs
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Inverses of triangular matrices and bipartite graphs
- Resistor networks based on symmetrical polytopes
- Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights
Cited In (2)
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)