Results 1 to 10 of about 3,634,246 (271)
Enumeration of the Multiplicative Degree-Kirchhoff Index in the Random Polygonal Chains [PDF]
Molecules, 2022 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
Wanlin Zhu, Xianya Geng
doaj +5 more sources
Bounds for the Kirchhoff Index of Bipartite Graphs [PDF]
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +6 more sources
Kirchhoff Index and Degree Kirchhoff Index of Tetrahedrane-Derived Compounds
Symmetry, 2023 Tetrahedrane-derived compounds consist of n crossed quadrilaterals and possess complex three-dimensional structures with high symmetry and dense spatial arrangements. As a result, these compounds hold great potential for applications in materials science, catalytic chemistry, and other related fields.
Kai Zhou, Duoduo Zhao
exaly +3 more sources
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
Discrete Applied Mathematics, 2017 The Kirchhoff index of a graph is defined as half of the sum of all effective resistance distances between any two vertices. Assuming a complete multipartite graph G, by methods from linear algebra we explicitly formulate effective resistance distances between any two vertices of G, and its Kirchhoff index. In rest of paper we explore extremal value of
Ravindra Bapat +2 more
exaly +6 more sources
Some Bounds for the Kirchhoff Index of Graphs [PDF]
Abstract and Applied Analysis, 2014 The resistance distance between two vertices of a connected graph G is defined as the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge of G with a unit resistor.
Yujun Yang
doaj +5 more sources
The Kirchhoff Index of Some Combinatorial Networks [PDF]
Discrete Dynamics in Nature and Society, 2015 The Kirchhoff index Kf(G) is the sum of the effective resistance distances between all pairs of vertices in G. The hypercube Qn and the folded hypercube FQn are well known networks due to their perfect properties. The graph G∗, constructed from G, is the
Jia-Bao Liu +3 more
doaj +5 more sources
Kirchhoff index of composite graphs [PDF]
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Yujun Yang
exaly +4 more sources
On lower bounds for the Kirchhoff index [PDF]
Kragujevac Journal of Science, 2017 Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kirchhoff index, Kf(G) = n Σ −1 i=
Milovanović I.Ž. 0000-0003-2209-9606 +1 more
doaj +4 more sources
Research on the Consensus Convergence Rate of Multi-Agent Systems Based on Hermitian Kirchhoff Index Measurement [PDF]
EntropyMulti-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 ...
He Deng, Tingzeng Wu
doaj +2 more sources
The Kirchhoff index of subdivisions of graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yujun Yang
exaly +2 more sources