Some bounds for the Kirchhoff index of graphs (Q1724990)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some bounds for the Kirchhoff index of graphs |
scientific article; zbMATH DE number 7023087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some bounds for the Kirchhoff index of graphs |
scientific article; zbMATH DE number 7023087 |
Statements
Some bounds for the Kirchhoff index of graphs (English)
0 references
14 February 2019
0 references
Summary: 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. The Kirchhoff index of \(G\) is the sum of resistance distances between all pairs of vertices. In this paper, general bounds for the Kirchhoff index are given via the independence number and the clique number, respectively. Moreover, lower and upper bounds for the Kirchhoff index of planar graphs and fullerene graphs are investigated.
0 references
0 references
0.8896167278289795
0 references
0.8638026118278503
0 references
0.8543175458908081
0 references
0.8541401624679565
0 references
0.8481578826904297
0 references
