Resistance distance

@article{Klein1993ResistanceD,
  title={Resistance distance},
  author={Douglas J. Klein and Milan Randic},
  journal={Journal of Mathematical Chemistry},
  year={1993},
  volume={12},
  pages={81-95}
}
The theory of resistive electrical networks is invoked to develop a novel view: if fixed resistors are assigned to each edge of a connected graph, then the effective resistance between pairs of vertices is a graphical distance. Several theorems concerning this novel distance function are established. 

Figures from this paper

Resistance Distances in Linear Polyacene Graphs
The resistance distance between any two vertices of a connected graph is defined as the net effective resistance between them in the electrical network constructed from the graph by replacing eachExpand
The Kirchhoff Index of Weighted Graphs 1
The resistance distance between two vertices of a connected graph G is computed as the effective resistance in the corresponding network constructed from G by replacing each edge of G with an unitExpand
Some Bounds for the Kirchhoff Index of Graphs
The resistance distance between two vertices of a connected graph is defined as the effective resistance between them in the corresponding electrical network constructed from by replacing each edgeExpand
The resistance distances of electrical networks based on Laplacian generalized inverse
In this paper, the generalized inverse representations for the Laplacian block matrices of graphs G 1 ? G 2 and G 1 ?s G 2 are proposed, based on which the explicit resistance distance can beExpand
Some results on resistance distances and resistance matrices
In this paper, we obtain formulas for resistance distances and Kirchhoff index of subdivision graphs. An application of resistance distances to the bipartiteness of graphs is given. We also give anExpand
Results on resistance distance and Kirchhoff index of graphs with generalized pockets
In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of graphs with generalized pockets in terms of the resistance distance and Kirchhoff index of the factorExpand
Some Results of Resistance Distance and Kirchhoff Index Based on R-Graph
The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edgeExpand
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
TLDR
The resistance distance between any two arbitrary vertices of a chain silicates network and a cyclic silicate network was procured by utilizing techniques from the theory of electrical networks, i.e., the series and parallel principles, the principle of elimination, the star-triangle transformation and the delta-wye transformation. Expand
Some Two-Vertex Resistances of Nested Triangle Network
TLDR
In this paper, some two-vertex resistances of nested triangle network was procured by utilizing techniques from the theory of electrical networks, i.e., the series and parallel principles, the principle of substitution, the star-triangle transformation and the delta-wye transformation. Expand
A Note On Bipartite Graphs with Domination Number 2 and 3
When each edge of a connected G graph is replaced by a unit resistor, the resistance distance is computed as the effective resistance between any two vertices in G . The Kirchhoff index of G is givenExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Random walks and electric networks
TLDR
The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory. Expand
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
Distance in graphs
Random walks and Electric Networks (Math
  • Assoc. Am., Washington,
  • 1984
Cir
  • Th. 5
  • 1958
J. Am. Chem. Soc
  • J. Am. Chem. Soc
  • 1947
Mathematical and computational concepts in chemistry
Aplik. Mat
  • Aplik. Mat
  • 1983
Adv
  • Math. 29
  • 1978
Adv. Math
  • Adv. Math
  • 1978
...
1
2
...