Results 41 to 50 of about 4,385,040 (261)
Consensus Problem of Noisy Weighted Scale-free Small-world Networks [PDF]
Jisuanji gongchengThis 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
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
On the Normalized Laplacian Spectrum of the Linear Pentagonal Derivation Chain and Its Application
Axioms, 2023 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
The Kirchhoff Index of Hypercubes and Related Complex Networks
Discrete Dynamics in Nature and Society, 2013 The resistance distance between any two vertices of G is defined as the network effective resistance between them if each edge of G is replaced by a unit resistor.
Jiabao Liu +3 more
doaj +1 more source
The minimum Kirchhoff index of phenylene chains [PDF]
Discrete Applied Mathematics, 2022 Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network constructed from $G$ by replacing each edge with a unit resistor.
Leilei Zhang
semanticscholar +1 more source
Kirchhoff index of periodic linear chains [PDF]
Journal of Mathematical Chemistry, 2015 A periodic linear chain consists of a weighted 2n -path where new edges have been added following a certain periodicity. In this paper, we obtain the effective resistance and the Kirchhoff index of a periodic linear chain as non trivial functions of the corresponding expressions for the path.
Carmona Mejías, Ángeles +2 more
openaire +3 more sources
Estimating Robustness Through Kirchhoff Index in Mesh Graphs
IEEE Access, 2020 The Kirchhoff index is a new measure of network robustness. In this paper, we study the robustness of $n \times m$ mesh graphes (denoted by $M_{n\times m}$ ) by determining the most important edges and the least important edges. In other words, we aim
Yuming Peng, Jianyao Li, Weihua He
doaj +1 more source
Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
, 2018 Most previous work of centralities focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially for weighted networks, due to the computational challenge. In this paper, we
Li, Huan, Zhang, Zhongzhi
core +1 more source
Russian Mathematical Surveys, 2023 The purpose of this survey is to describe invariants of cyclic coverings of graphs. The covered graph is assumed to be fixed, and the cyclic covering group has an arbitrarily large order. A classical example of such a covering is a circulant graph.
A. Mednykh, I. Mednykh
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView.Phase‐field simulations coupled with dislocation‐density‐based crystal plasticity modeling reproduce γ′ rafting behavior in single‐crystal Ni‐based superalloys under varied loading conditions. The model captures both macroscopic creep and microscopic morphology evolution, with results matching high‐temperature creep experiments.
Micheal Younan +5 more
wiley +1 more source