Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (Q781753): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2020/5307670 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3034591832 / rank | |||
Normal rank |
Revision as of 22:38, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network |
scientific article |
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