Results 21 to 30 of about 6,263,611 (271)

Results on Resistance Distance and Kirchhoff Index of Graphs With Generalized Pockets

open access: yesFrontiers 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

Resistance distances on networks [PDF]

open access: yesApplicable 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

A Relation Between Moore-Penrose Inverses of Hermitian Matrices and Its Application in Electrical Networks

open access: yesFrontiers 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

DbSWPT: A Novel Distance-based Switch for Efficient Wireless Power Transfer in Battery-less Wireless Capsule Endoscopy [PDF]

open access: yesJournal 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 Training for Distance Running [PDF]

open access: yesStrength and Conditioning Journal, 2007
The positive effects of resistance training on distance-running performance through enhanced running economy are well established. However, few practical recommendations exist to aid coaches in planning resistance training to supplement a distance-running program.
Jones, Paul, Bampouras, Theodoros M.
openaire   +1 more source

Monotonicity of random walks’ states on finite grids

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2022
In this paper two ways to order the nodes of a graph with respect to an arbitrary node are considered, both connected to random walks on the graph. The first one is the order according to probabilities of states of a random walk of fixed length started ...
Anna O. Zadorozhnuyk
doaj   +1 more source

A Note on Resistance Distances of Graphs

open access: yesFrontiers in Physics, 2022
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   +1 more source

On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks

open access: yesMathematics, 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

Finding the Resistance Distance and Eigenvector Centrality from the Network's Eigenvalues [PDF]

open access: yesPhysica A: Statistical Mechanics and its Applications, 2020
There are different measures to classify a network's data set that, depending on the problem, have different success. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and ...
Caracé Gutiérrez   +3 more
semanticscholar   +1 more source

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2019
Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain tree.
Jun Ge, F. Dong
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy