Results 41 to 50 of about 6,277,316 (173)
On resistance distance of Markov chain and its sum rules [PDF]
Motivated by the notion of resistance distance on graph, we define a new resistance distance between two states on a given finite ergodic Markov chain based on its fundamental matrix.
Michael C. H. Choi
semanticscholar +1 more source
The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +1 more source
Degree resistance distance of trees with some given parameters [PDF]
The degree resistance distance of a graph $G$ is defined as $D_R(G)=\sum_ ...
Fangguo He, Xinnong Jiang
doaj +1 more source
Effectiveness of corridors varies among phytosociological plant groups and dispersal syndromes. [PDF]
In agricultural landscapes, semi-natural habitats are scarce and remaining habitat patches are largely isolated. However, linear landscape elements might facilitate dispersal of plant species through the agricultural landscape matrix. We investigated the
Jan Thiele +2 more
doaj +1 more source
Research on frequency stability of magnetic coupling wireless power transfer system
The natural oscillation frequency of the magnetic coupling wireless power transfer system is easily affected by circuit parameters and frequency bifurcation phenomenon often occurs.
ZHANG Lian +4 more
doaj +1 more source
Resistance distance in straight linear 2-trees [PDF]
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 ...
W. Barrett, E. Evans, A. Francis
semanticscholar +1 more source
Concerning the distance protection steady‐state over‐reach or under‐reach caused by the transition resistance, a novel distance protection scheme based on transient information is proposed.
Yifan Li +4 more
doaj +1 more source
Spanning 2-forests and resistance distance in 2-connected graphs [PDF]
A spanning 2-forest separating vertices $u$ and $v$ of an undirected connected graph is a spanning forest with 2 components such that $u$ and $v$ are in distinct components.
W. Barrett +4 more
semanticscholar +1 more source
Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants
Two decades ago, resistance distance was introduced to characterize “chemical distance” in (molecular) graphs. In this paper, we consider three resistance distance-based graph invariants, namely, the Kirchhoff index, the additive degree-Kirchhoff index ...
Das Kinkar Ch., Yang Yujun, Xu Kexiang
doaj +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
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 Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source

