Upper and Lower Bounds for the Kirchhoff Index of the n -Dimensional Hypercube Network

Jia-Bao Liu, Jing Zhao, Zhi-Yu Shi, Jinde Cao and Fuad E. Alsaadi

Complexity, 2020, vol. 2020, 1-4

Abstract:

The hypercube is one of the most admirable and efficient interconnection network due to its excellent performance for some practical applications. The Kirchhoff index 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 .

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/5307670.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/5307670.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5307670

DOI: 10.1155/2020/5307670

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().