A new proof of Foster's first theorem

DOI10.1080/00029890.2020.1668709zbMATH Open1429.05104OpenAlexW2995996879MaRDI QIDQ5207481FDOQ5207481

Authors: Jingyuan Zhang, Weigen Yan 

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

Recommendations

• An Extension of Foster's Network Theorem
• Foster, Turán, and neighbors
• Resistance networks, random walks, and network theorems
• Sum rules for effective resistances in infinite graphs
• Random walks and the effective resistance sum rules

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)

Cites Work

• Title not available (Why is that?)
• Random walks and the effective resistance of networks
• Title not available (Why is that?)
• Random walks and the effective resistance sum rules
• An Extension of Foster's Network Theorem

Cited In (7)

• Resistance distances in vertex-weighted complete multipartite graphs
• An Extension of Foster's Network Theorem
• An Electrical Lemma
• On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
• Foster, Turán, and Neighbors
• A combinatorial proof of the Rayleigh formula for graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs

This page was built for publication: A new proof of Foster's first theorem

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