Results 21 to 30 of about 4,242,053 (289)
Frontiers in Physics, 2020 A novel relation between the Moore-Penrose inverses of two nullity-1 n × n Hermitian matrices which share a common null eigenvector is established, and its application in electrical networks is illustrated by applying the result to Laplacian matrices of ...
Yujun Yang +2 more
doaj +1 more source
Results on Resistance Distance and Kirchhoff Index of Graphs With Generalized Pockets
Frontiers in Physics, 2022 F, Hv are considered simple connected graphs on n and m + 1 vertices, and v is a specified vertex of Hv and u1, u2, … uk ∈ F. The graph G = G[F, u1, … , uk, Hv] is called a graph with k pockets, obtained by taking one copy of F and k copies of Hv and ...
Qun Liu, Jiaqi Li
doaj +1 more source
DbSWPT: A Novel Distance-based Switch for Efficient Wireless Power Transfer in Battery-less Wireless Capsule Endoscopy [PDF]
Journal of Engineering Research - Egypt, 2022 The restricted power supply of batteries hampered the development of capsule endoscopy. Accordingly, a distance-based switch is proposed for efficient wireless power transfer (WPT) system. It targets battery-less wireless capsule endoscopy (WCE).
Marwa Elsawy +2 more
doaj +1 more source
Resistance distance in connected balanced digraphs
Discrete Applied Mathematics, 2023 Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E.$ The classical distance $d_{ij}^D$ from $i$ to $j$ in $D$ is the length of a shortest directed path from $i$ to $j$ in $D.$ Let $L$ be the Laplacian matrix of $D$ and $ L^{\dagger} = ( l_{ij}^{\dagger} )$ be the Moore-Penrose inverse of $L.$ The resistance
R. Balakrishnan +2 more
openaire +4 more sources
On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks
Mathematics, 2019 The normalized Laplacian plays an important role on studying the structure properties of non-regular networks. In fact, it focuses on the interplay between the structure properties and the eigenvalues of networks. Let H n be the linear heptagonal
Jia-Bao Liu +3 more
doaj +1 more source
Resistance distances on networks [PDF]
Applicable Analysis and Discrete Mathematics, 2017 This paper aims to study a family of distances in networks associated with effective resistances. Specifically, we consider the effective resistance distance with respect to a positive parameter and a weight on the vertex set; that is, the effective resistance distance associated with an irreducible and symmetric M-matrix whose lowest ...
Carmona Mejías, Ángeles +2 more
openaire +4 more sources
Resistance Distance in the Double Corona Based on R-Graph
Mathematics, 2019 Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end
Li Zhang +3 more
doaj +1 more source
Individual resistance to difficulties during distance learning
Вестник Мининского университета, 2021 Introduction. The pandemic situation, the rapid transition to distance learning forms - all this was a serious test for participants in the educational environment.
N. I. Dunaeva, P. A. Egorova
doaj +1 more source
On electric resistances for distance-regular graphs [PDF]
European Journal of Combinatorics, 2013 We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency.
Jack H. Koolen +2 more
openaire +3 more sources
The Extremal Cacti on Multiplicative Degree-Kirchhoff Index
Mathematics, 2019 For a graph G, the resistance distance r G ( x , y ) is defined to be the effective resistance between vertices x and y, the multiplicative degree-Kirchhoff index R ∗ ( G ) = ∑ { x , y } ⊂ V ( G ) d G ( x ) d G
Fangguo He, Zhongxun Zhu
doaj +1 more source