Results 11 to 20 of about 4,385,040 (261)
Kirchhoff Index and Degree Kirchhoff Index of Tetrahedrane-Derived Compounds
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,
Duoduo Zhao +4 more
semanticscholar +2 more sources
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
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 B. Bapat +2 more
openaire +5 more sources
Kirchhoff index of composite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Heping, Yang, Yujun, Li, Chuanwen
openaire +4 more sources
The Kirchhoff Index of Some Combinatorial Networks [PDF]
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 +3 more sources
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.
Meilian Li +4 more
semanticscholar +2 more sources
Extremal Kirchhoff index in polycyclic chains [PDF]
The Kirchhoff index of graphs, introduced by Klein and Randi\'{c} in 1993, has been known useful in the study of computer science, complex network and quantum chemistry.
Hechao Liu, L. You
semanticscholar +4 more sources
Effective resistances and Kirchhoff index in subdivision networks [PDF]
We define a subdivision network ¿S of a given network ¿; by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network.
Carmona Mejías, Ángeles +2 more
core +7 more sources
Bounds for the Kirchhoff Index of Bipartite Graphs [PDF]
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 +4 more sources
Concentration of the Kirchhoff index for Erdos-Renyi graphs [PDF]
Given an undirected graph, the resistance distance between two nodes is the resistance one would measure between these two nodes in an electrical network if edges were resistors.
Boumal, Nicolas, Cheng, Xiuyuan
core +4 more sources
Some Bounds for the Kirchhoff Index of Graphs [PDF]
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 +3 more sources

