A New Proof of Foster’s First Theorem

DOI10.1080/00029890.2020.1668709zbMath1429.05104OpenAlexW2995996879MaRDI QIDQ5207481

Weigen Yan, Jingyuan Zhang

Publication date: 2 January 2020

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

Full work available at URL: https://doi.org/10.1080/00029890.2020.1668709

zbMATH Keywords

electrical network graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Random walks on graphs (05C81)

Related Items (4)

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs ⋮ Foster, Turán, and Neighbors ⋮ Resistance distances in vertex-weighted complete multipartite graphs

Cites Work

• Random walks and the effective resistance sum rules
• Random walks and the effective resistance of networks
• An Extension of Foster's Network Theorem
• Unnamed Item
• Unnamed Item

This page was built for publication: A New Proof of Foster’s First Theorem