Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
Joint Authors
Liu, Jia-Bao
Cao, Jinde
Alsaadi, Fuad E.
Zhao, Jing
Shi, Zhi-Yu
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-06-16
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Abstract EN
The hypercube Qn is one of the most admirable and efficient interconnection network due to its excellent performance for some practical applications.
The Kirchhoff index KfG 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 Qn.
American Psychological Association (APA)
Liu, Jia-Bao& Zhao, Jing& Shi, Zhi-Yu& Cao, Jinde& Alsaadi, Fuad E.. 2020. Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network. Complexity،Vol. 2020, no. 2020, pp.1-4.
https://search.emarefa.net/detail/BIM-1142379
Modern Language Association (MLA)
Liu, Jia-Bao…[et al.]. Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network. Complexity No. 2020 (2020), pp.1-4.
https://search.emarefa.net/detail/BIM-1142379
American Medical Association (AMA)
Liu, Jia-Bao& Zhao, Jing& Shi, Zhi-Yu& Cao, Jinde& Alsaadi, Fuad E.. Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network. Complexity. 2020. Vol. 2020, no. 2020, pp.1-4.
https://search.emarefa.net/detail/BIM-1142379
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1142379
