Results 31 to 40 of about 4,385,040 (261)

Kirchhoff Indexes of a network

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

On Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs [PDF]

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

Topological atomic displacements, Kirchhoff and Wiener indices of molecules [PDF]

open access: yes, 2009
We provide a physical interpretation of the Kirchhoff index of any molecules as well as of the Wiener index of acyclic ones. For the purpose, we use a local vertex invariant that is obtained from first principles and describes the atomic displacements ...
Estrada, Ernesto, Hatano, Naomichi
core   +2 more sources

On hyper-Kirchhoff index

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

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

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

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

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

Validation of Fresnel–Kirchhoff Integral Method for the Study of Volume Dielectric Bodies

open access: yesApplied Sciences, 2021
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

A Vibrational Approach to Node Centrality and Vulnerability in Complex Networks [PDF]

open access: yes, 2009
We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs.
Barthelemy   +31 more
core   +3 more sources

Home - About - Disclaimer - Privacy