Results 1 to 10 of about 4,385,040 (261)
Enumeration of the Multiplicative Degree-Kirchhoff Index in the Random Polygonal Chains. [PDF]
Multiplicative degree-Kirchhoff index is a very interesting topological index. In this article, we compute analytical expression for the expected value of the Multiplicative degree-Kirchhoff index in a random polygonal. Based on the result above, we also
Zhu W, Geng X.
europepmc +4 more sources
Research on the Consensus Convergence Rate of Multi-Agent Systems Based on Hermitian Kirchhoff Index Measurement. [PDF]
Multi-agent systems (MAS) typically model interaction topologies using directed or undirected graphs when analyzing consensus convergence rates. However, as system complexity increases, purely directed or undirected networks may be insufficient to ...
Deng H, Wu T.
europepmc +3 more sources
Evolution of Robustness in Growing Random Networks. [PDF]
Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve.
Tyloo M.
europepmc +2 more sources
Extremal values on the Kirchhoff index of the line graph of trees
The computation of resistance distance and the Kirchhoff index is a classical problem that has been extensively investigated by numerous mathematicians, physicists, and scientists. Consider a simple connected graph G with vertex set V(G) and edge set E(G)
M. S. Sardar +2 more
doaj +2 more sources
Let Hn be the linear heptagonal networks with 2n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of Hn, we utilize the method of decompositions. Thus, the Laplacian
Jia-Bao Liu +3 more
doaj +2 more sources
Computing the Laplacian spectrum and Wiener index of pentagonal-derivation cylinder/Möbius network [PDF]
The Laplacian spectrum significantly contributes the study of the structural features of non-regular networks. Actually, it emphasizes the interaction among the network eigenvalues and their structural properties.
Ali U, Li J, Ahmad Y, Raza Z.
europepmc +2 more sources
On Laplacian resolvent energy of graphs [PDF]
Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\geq d_{
Sandeep Bhatnagar +2 more
doaj +1 more source
Enumeration of the Additive Degree–Kirchhoff Index in the Random Polygonal Chains
The additive degree–Kirchhoff index is an important topological index. This paper we devote to establishing the explicit analytical expression for the simple formulae of the expected value of the additive degree–Kirchhoff index in a random polygon. Based
Xianya Geng, Wanlin Zhu
doaj +1 more source
It is well known that many topological indices have widespread use in lots of fields about scientific research, and the Kirchhoff index plays a major role in many different sectors over the years. Recently, Li et al. (Appl. Math. Comput.
Jia-Bao Liu +3 more
doaj +1 more source
Comparison of the Wiener and Kirchhoff Indices of Random Pentachains
Let G be a connected (molecule) graph. The Wiener index WG and Kirchhoff index KfG of G are defined as the sum of distances and the resistance distances between all unordered pairs of vertices in G, respectively.
Shouliu Wei +3 more
doaj +1 more source

