Results 221 to 230 of about 2,178 (257)

Kirchhoff Index for Circulant Graphs and Its Asymptotics

Doklady Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mednykh, A. D., Mednykh, I. A.
openaire   +2 more sources

Kirchhoff index of linear hexagonal chains

International Journal of Quantum Chemistry, 2007
AbstractThe resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices.
Yujun Yang, Heping Zhang
openaire   +1 more source

The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leilei Zhang, Qishun Li, Shuchao Li, Minjie Zhang   +3 more
openaire   +1 more source

Kirchhoff index of linear pentagonal chains

International Journal of Quantum Chemistry, 2009
AbstractThe resistance distance rij between two vertices vi and vj of a connected graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices.
Yan Wang, Wenwen Zhang
openaire   +1 more source

Kirchhoff index of a linear hexagonal chain

2022
Let $H_n$ be a linear hexagonal chain with $n$ hexagons. In this paper, we give a decomposition theorem of Laplacian polynomial of weighted graphs and obtain that the Laplacian spectrum of $H_n$ consists of the eigenvalues of a symmetric tridiagonal matrices of order $4n+2$ and the Laplacian eigenvalues of $2n$ $K_2s$.
Juan Yan, zhenzhen Lou
openaire   +1 more source

Closed-form formulas for Kirchhoff index

International Journal of Quantum Chemistry, 2000
We find closed-form expressions for the resistance, or Kirchhoff index, of certain connected graphs using Foster's theorems, random walks, and the superposition principle. © 2001 John Wiley & Sons, Inc.
openaire   +1 more source

Simplicial Kirchhoff index of random complexes

Advances in Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kook, Woong, Lee, Kang-Ju
openaire   +2 more sources

On the Kirchhoff Index of Graphs

Zeitschrift für Naturforschung A, 2013
Let G be a connected graph of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ ... ≥ μn-1 > mn = 0. The Kirchhoff index of G is defined as [xxx] In this paper. we give lower and upper bounds on Kf of graphs in terms on n, number of edges, maximum degree, and number of spanning trees.
openaire   +1 more source

The weighted Kirchhoff index of a graph

Linear Algebra and its Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitsuhashi, Hideo, Morita, Hideaki, Sato, Iwao   +2 more
openaire   +1 more source

Extremal polygonal cacti for Wiener index and Kirchhoff index

2020
For a connected graph G, the Wiener index W(G) of G is the sum of the distances of all pairs of vertices, the Kirchhoff index Kf(G) of G is the sum of the resistance distances of all pairs of vertices. A k-polygonal cactus is a connected graph in which the length of every cycle is k and any two cycles have at most one common vertex.
Zeng, Mingyao, Xiao, Qiqi, Tang, Zikai, Deng, Hanyuan   +3 more
openaire   +1 more source