Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (Q781753)
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: Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network |
scientific article; zbMATH DE number 7222451
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network |
scientific article; zbMATH DE number 7222451 |
Statements
Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (English)
0 references
18 July 2020
0 references
Summary: The hypercube \(Q_n\) is one of the most admirable and efficient interconnection network due to its excellent performance for some practical applications. The Kirchhoff index \(\text{Kf}\left( G\right)\) is equal to the sum of resistance distances between any pairs of vertices in networks. In this paper, we deduce some bounds with respect to Kirchhoff index of hypercube network \(Q_n\).
0 references
0 references
0 references
0.8693022727966309
0 references
0.8462876081466675
0 references
0.8251652717590332
0 references
0.7808265686035156
0 references
