Results 1 to 10 of about 4,242,053 (289)
Phylogenetic Networks as Circuits With Resistance Distance [PDF]
Phylogenetic networks are notoriously difficult to reconstruct. Here we suggest that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits. This resistance distance,
Stefan Forcey, Drew Scalzo
doaj +6 more sources
Eigenvalues of the resistance-distance matrix of complete multipartite graphs [PDF]
Let G = ( V , E ) $G=(V, E)$ be a simple graph. The resistance distance between i , j ∈ V $i,j\in V$ , denoted by r i j $r_{ij}$ , is defined as the net effective resistance between nodes i and j in the corresponding electrical network constructed from G
Kinkar Chandra Das, Yujun Yang
doaj +2 more sources
The relationship between least-cost and resistance distance. [PDF]
Least-cost modelling and circuit theory are common analogs used in ecology and evolution to model gene flow or animal movement across landscapes. Least-cost modelling estimates the least-cost distance, whereas circuit theory estimates resistance distance.
Robby R Marrotte, Jeff Bowman
doaj +2 more sources
A Note on Resistance Distances of Graphs
Let G be a connected graph with vertex set V(G). The resistance distance between any two vertices u, v ∈ V(G) is the net effective resistance between them in the electric network constructed from G by replacing each edge with a unit resistor. Let S ⊂ V(G)
Wensheng Sun, Yujun Yang
doaj +2 more sources
The degree resistance distance of cacti
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Junfeng Du, Jianhua Tu
exaly +5 more sources
On degree resistance distance of cacti
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang-Feng Pan, Jia-Bao Liu
exaly +3 more sources
The Resistance Distance Is a Diffusion Distance on a Graph
The resistance distance is a squared Euclidean metric on the vertices of a graph derived from the consideration of a graph as an electrical circuit. Its connection with the commute time of a random walker on the graph has made it particularly appealing ...
Ernesto Estrada
doaj +3 more sources
Resistance distance and the normalized Laplacian spectrum
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuji Zhang
exaly +4 more sources
Indexing Simple Graphs by Means of the Resistance Distance
For every simple connected graph, we present a polynomial time algorithm for computing a numerical index, which is composed of primary and secondary parts.
Chatchawit Aporntewan +2 more
doaj +2 more sources
Resistance distance in straight linear 2-trees
We consider the graph $G_n$ with vertex set $V(G_n) = \{ 1, 2, \ldots, n\}$ and $\{i,j\} \in E(G_n)$ if and only if ...
Emily Evans, Wayne Barrett
exaly +6 more sources

