A Simple Method for Computing Resistance Distance Export

@unpublished{citeulike:2296661, abstract = {The resistance distance ri j between two vertices vi and vj of a (connected, molecular) graph G is equal to the effective resistance between the respective two points of an electrical network, constructed so as to correspond to G, such that the resistance of any edge is unity. We show how ri j can be computed from the Laplacian matrix L of the graph G: Let L(i) and L(i, j) be obtained from L by deleting its i-th row and column, and by deleting its i-th and j-th rows and columns, respectively. Then ri j = detL(i, j)/detL(i).}, author = {Bapat and Gutman}, citeulike-article-id = {2296661}, comment = {* like Wu's Potts paper, proof based on extremal characterization of resistance}, keywords = {resistance}, posted-at = {2008-01-28 07:35:24}, priority = {2}, title = {A Simple Method for Computing Resistance Distance}, year = {2003} }

TY - UNPB ID - citeulike:2296661 L3 - citeulike-article-id:2296661 N2 - The resistance distance ri j between two vertices vi and vj of a (connected, molecular) graph G is equal to the effective resistance between the respective two points of an electrical network, constructed so as to correspond to G, such that the resistance of any edge is unity. We show how ri j can be computed from the Laplacian matrix L of the graph G: Let L(i) and L(i, j) be obtained from L by deleting its i-th row and column, and by deleting its i-th and j-th rows and columns, respectively. Then ri j = detL(i, j)/detL(i). TI - A Simple Method for Computing Resistance Distance KW - resistance N1 - * like Wu's Potts paper, proof based on extremal characterization of resistance AU - Bapat AU - Gutman PY - 2003/// ER -