Results 21 to 30 of about 2,153 (243)
Resistance Distances and Kirchhoff Indices Under Graph Operations
IEEE Access, 2020 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
Linear Algebra and its Applications, 2010 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
Symmetry, 2023 Several topological indices are known to have widespread implications in a variety of research areas. Over the years, the Kirchhoff index has turned out to be an extremely significant and efficient index. In this paper, we propose the exact formulas for the expected values of the random polyomino chain to construct the multiplicative degree-Kirchhoff ...
Meilian Li +4 more
openaire +1 more source
On Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 Let G be a simple connected graph with n ≤ 2 vertices and m edges, and let μ1 ≥ μ2 ≥...≥μn-1 >μn=0 be its Laplacian eigenvalues. The Kirchhoff index and Laplacian-energy-like invariant (LEL) of graph G are defined as Kf(G)=nΣi=1n-11/μi and LEL(G)=Σi=1n-1
Emina Milovanovic +2 more
doaj +1 more source
Mathematical and Computer Modelling, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xing, Rundan, Zhou, Bo
openaire +1 more source
Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
Complexity, 2020 The hypercube Qn is one of the most admirable and efficient interconnection network due to its excellent performance for some practical applications. The Kirchhoff index KfG is equal to the sum of resistance distances between any pairs of vertices in ...
Jia-Bao Liu +4 more
doaj +1 more source
Kirchhoff Index of Cyclopolyacenes
Zeitschrift für Naturforschung A, 2010 The resistance distance between two vertices of a connected graph G is computed as the effective resistance between them in the corresponding network constructed from G by replacing each edge with a unit resistor. The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices. In this paper, following the method of Y. J. Yang
Yan Wang, Wenwen Zhang
openaire +1 more source
Mean Hitting Time for Random Walks on a Class of Sparse Networks
Entropy, 2021 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
Discussiones Mathematicae Graph Theory, 2016 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]
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