A physics perspective on the resistance distance for graphs

DOI10.1007/s11786-018-0340-xzbMath1474.94102OpenAlexW2802457484MaRDI QIDQ2319447

Brian Mata, Mikhail Kagan

Publication date: 19 August 2019

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-018-0340-x

zbMATH Keywords

circulant graphsrandom walks on graphsresistance distancestar graphswheel graphsequivalent resistance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analytic circuit theory (94C05) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (3)

Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Kirchhoff index for circulant graphs and its asymptotics ⋮ Resistance distance of blowups of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance in wheels and fans
• Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
• The effective resistance of the \(N\)-cycle graph with four nearest neighbors

This page was built for publication: A physics perspective on the resistance distance for graphs