||In this report, we survey four existing methods to|
determine resistance distances between two nodes on a grid.
First, we show how to compute the effective resistances by using the spectrum of Laplacian L of a graph G. Then, we describe how to compute the effective resistances by using the pseudo inverse L^+ of a Laplacian L. Next, we use the the series, parallel and Y-Delta transformations to compute the effective resistances between two nodes in a grid. At last, we introduce the celebrated Kirchhoff′s Theorem and use it to compute the effective resistances in a resistance network.
||Bela Bollobas, Modern Graph Theory, Graduate Texts in Mathematics,|
vol. 184, Springer, 1998.
G. R. Grimmett, Probability on Graphs: : Random Processes on Graphs and Lattices, Institute of Mathematical Statistics Textbooks (Book 1), Cambridge University Press, 1st edition, 2010.
A.E. Kennelly, The equivalence of triangles and three-pointed stars in conducting networks, Electrical World and Engineer, vol. 34, pp. 413-414, 1899.
G.R. Kirchhoff, Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung
galvanischer Strome gefuhrt wird, Ann. Phys. Chem. 72 (4) (1847) 497-508., gesammelte Abhandlungen, Leipzig, 1882
Daniel A. Spielman,
Course Notes for Spectral Graph Theory - Lectures 7 and 8, Fall
2015, Yale University, USA.
Hong-Gwa Yeh, Class Notes for Graph Structure Theory, Fall 2016, National Central University, Taiwan.
F. Y. Wu, Theory of resistor networks: The two-point resistance, J. Phys. A: Math. Gen. 37 (2004) 6653-6673.
A. V. Bakshi and U. A. Bakshi,
Electric Circuit Analysis, Technical Publications, 2008.