Results 31 to 40 of about 3,634,246 (271)
A family of c-cyclic graphs with a Θ(|V|2log|V|) Kirchhoff index
By means of a recurrence, we provide a family of c-cyclic graphs, c≥0, whose Kirchhoff index is Θ(|V|2log|V|).
José Luis Palacios
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rundan Xing, Bo Zhou 0007
openaire +1 more source
Resistance Distances and Kirchhoff Indices Under Graph Operations
The resistance distance between any two vertices of a connected graph $G$ is defined as the net effective resistance between them in the electrical network constructed from $G$ by replacing each edge with a unit resistor. The Kirchhoff index of $G$
Yujun Yang, Yue Yu
doaj +1 more source
Kirchhoff Indexes of a network
In this work we define the effective resistance between any pair of vertices with respect to a value λ ≥ 0 and a weight ω on the vertex set. This allows us to consider a generalization of the Kirchhoff Index of a finite network. It turns out that λ is the lowest eigenvalue of a suitable semi-definite positive Schrödinger operator and ω is the ...
Bendito Pérez, Enrique +4 more
openaire +3 more sources
Mean Hitting Time for Random Walks on a Class of Sparse Networks
For random walks on a complex network, the configuration of a network that provides optimal or suboptimal navigation efficiency is meaningful research. It has been proven that a complete graph has the exact minimal mean hitting time, which grows linearly
Jing Su, Xiaomin Wang, Bing Yao
doaj +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
Consensus Problem of Noisy Weighted Scale-free Small-world Networks [PDF]
This study investigates the consensus problem, a fundamental issue in distributed systems and network control. Consensus studies have traditionally focused on unweighted networks, overlooking the impact of edge weights in real-world networks.
DONG Yuze, ZHANG Zhongzhi
doaj +1 more source
Validation of Fresnel–Kirchhoff Integral Method for the Study of Volume Dielectric Bodies
In this work, we test a nondestructive optical method based on the Fresnel–Kirchhoff integral, which could be applied to different fields of engineering, such as detection of small cracks in structures, determination of dimensions for small components ...
Soumia Imane Taleb +7 more
doaj +1 more source
On the Normalized Laplacian Spectrum of the Linear Pentagonal Derivation Chain and Its Application
A novel distance function named resistance distance was introduced on the basis of electrical network theory. The resistance distance between any two vertices u and v in graph G is defined to be the effective resistance between them when unit resistors ...
Yuqing Zhang, Xiaoling Ma
doaj +1 more source
kinnala/kirchhoff-nitsche-ex3 v1
A numerical experiment for the paper "Nitsche's method for Kirchhoff plates". Use "Launch Binder" link in the following url to rerun the experiment in the web browser: https://github.com/kinnala/kirchhoff-nitsche-ex3/tree ...
Tom Gustafsson
core +1 more source

