An Algebraic Proof of Kirchhoff's Network Theorem

DOI10.2307/2311455MaRDI QIDQ3285873zbMATH OpenOpenAlexFDO

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)

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

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)