Recommendations
Cites work
Cited in
(22)- Complete characterization of resistance distance for linear octagonal networks
- Sum rules for effective resistances in infinite graphs
- Comparison theorems on resistance distances and Kirchhoff indices of S,T-isomers
- Resistance between two vertices of almost complete bipartite graphs
- Two-point resistances and random walks on stellated regular graphs
- Resistances between two nodes of a path network
- Resistance distances in the linear polyomino chain
- On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
- Random walks and the effective resistance sum rules
- A recursion formula for resistance distances and its applications
- Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
- Algorithmic techniques for finding resistance distances on structured graphs
- Some results on the resistance-distance spectrum
- Effective resistances and spanning trees in the complete bipartite graph plus a matching
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants
- Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron
- Resistance distance in generalized core-satellite graphs
- Some rules on resistance distance with applications
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- Some two-point resistances of the Sierpinski gasket network
- Sum of powers of the Laplacian eigenvalues and the Kirchhoff index of a graph
- Two-point resistances in the generalized phenylenes
This page was built for publication: Resistance distance local rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551944)