Results 1 to 10 of about 6,263,611 (271)
Phylogenetic Networks as Circuits With Resistance Distance [PDF]
Frontiers in Genetics, 2020 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 +8 more sources
The relationship between least-cost and resistance distance. [PDF]
PLoS ONE, 2017 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 +6 more sources
Eigenvalues of the resistance-distance matrix of complete multipartite graphs [PDF]
Journal of Inequalities and Applications, 2017 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 +3 more sources
Construction of Ecological Security Patterns Based on Circuit Theory under the Resistance Distance Principle. [PDF]
Int J Environ Res Public Health, 2022 Against the background of China’s advocating ecological civilisation construction, an urgent task and a major challenge are to identify key places for ecological protection and restoration and then propose optimisation strategies for future land use ...
Chen J, Mei Z, Wang B, Wei J.
europepmc +2 more sources
Graph curvature via resistance distance [PDF]
Discrete Applied Mathematics, 2023 15 pages, 2 ...
Devriendt, K +2 more
openaire +5 more sources
Resistance Distances in Linear Polyacene Graphs [PDF]
Frontiers in Physics, 2021 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 each edge with a unit resistor.
Dayong Wang, Yujun Yang
doaj +2 more sources
The Resistance Distance and Kirchhoff Index on Quadrilateral Graph and Pentagonal Graph [PDF]
IEEE Access, 2019 The quadrilateral graph Q(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 3, whereas the pentagonal graph W(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 4.
Qun Liu
doaj +2 more sources
A Novel and Efficient Method for Computing the Resistance Distance
IEEE Access, 2021 The resistance distance is an intrinsic metric on graphs that have been extensively studied by many physicists and mathematicians. The resistance distance between two vertices of a simple connected graph $G$ is equal to the resistance between two ...
Muhammad Shoaib Sardar +3 more
doaj +2 more sources
Resistance distance in directed cactus graphs [PDF]
The Electronic Journal of Linear Algebra, 2020 Let $G=(V,E)$ be a strongly connected and balanced digraph with vertex set $V=\{1,\dotsc,n\}$. The classical distance $d_{ij}$ between any two vertices $i$ and $j$ in $G$ is the minimum length of all the directed paths joining $i$ and $j$. The resistance distance (or, simply the resistance) between any two vertices $i$ and $j$ in $V$ is defined by $r_ ...
R. Balaji, R.B. Bapat, Shivani Goel
openaire +5 more sources
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs [PDF]
Discrete Dynamics in Nature and Society, 2021 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +5 more sources