Skip to search formSkip to main contentSkip to account menu

Resistance distance

In graph theory, the resistance distance between two vertices of a simple connected graph, G, is equal to the resistance between two equivalent… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Conductance (graph)Distance (graph theory)Euclidean distanceGraph (discrete mathematics)

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Assessing the performance of common landscape connectivity metrics using a virtual ecologist approach
2018
2018
Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
Highly Cited
2016
Highly Cited
2016
Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
2013
2013
The Kirchhoff indices and the matching numbers of unicyclic graphs
2013
2013
New upper and lower bounds for the additive degree-Kirchhoff index
We give tight upper and lower bounds for the additive degree-Kirchhoff index of a connected undirected graph. 
2013
2013
The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
Highly Cited
2012
Highly Cited
2012
Degree resistance distance of unicyclic graphs
Let $G$ be a connected graph with vertex set $V(G)$‎. ‎The‎ ‎degree resistance distance of $G$ is defined as $D_R(G) = sum_{{u… 
2012
2012
The Kirchhoff indexes of some composite networks
Highly Cited
2010
Highly Cited
2010
Getting lost in space: Large sample analysis of the resistance distance
The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the… 
Highly Cited
2009
Highly Cited
2009
Kirchhoff index of composite graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)