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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled… 
2016
2016
In this work, we explicitly compute the group inverse of symmetric and periodic Jacobi matrices. 
2014
2014
Here, we consider a class of generalized linear chains; that is, the ladder-like chains as a perturbation of a 2n path by adding… 
2009
2009
We study convergence properties of the resistance distance on random geometric graphs for increasing sample size. It turns out… 
2004
2004
The line Nantais Oblong, a melon of Charentais type, was shown to be a source of resistance by antibiosis to the leafminer… 
2003
2003
Some further chemical applications of the Laplacian spectra are reported. The Kel'mans theorem for the calculation of the… 
2003
2003
  • X. Hui
  • 2003
  • Corpus ID: 124982502
From the Laplacian spectrum of graph G1 and G2,we get the Laplacian spectrum of G1×G2 and G1and compute Kirchhoff… 
2001
2001
Septoria tritici blotch (STB), a fungal foliar disease of wheat (Triticam aestivum L.) caused by Septoria tritici Rob. ex Desm…