An Algebraic Proof of Kirchhoff's Network Theorem

DOI10.2307/2311455zbMATH Open0102.33902OpenAlexW2319011006MaRDI QIDQ3285873FDOQ3285873

Authors: Herbert S. Shank, Anil Nerode 

Publication date: 1961

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2311455

zbMATH Keywords

numerical analysis

Cited In (10)

• On Numerical Invariant of Graph
• The combinatorics of effective resistances and resistive inverses
• Harmonic cycles for graphs
• Determinantal probability measures on Grassmannians
• Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
• Complete monotonicity for inverse powers of some combinatorially defined polynomials
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• Leaky Electricity: 1-Chain Formulas for the Current and Voltage
• Potential Theory on Distance-Regular Graphs
• High-dimensional networks and spanning forests

This page was built for publication: An Algebraic Proof of Kirchhoff's Network Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3285873)