Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
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 wi...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/5307670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551013450514432 |
|---|---|
| author | Jia-Bao Liu Jing Zhao Zhi-Yu Shi Jinde Cao Fuad E. Alsaadi |
| author_facet | Jia-Bao Liu Jing Zhao Zhi-Yu Shi Jinde Cao Fuad E. Alsaadi |
| author_sort | Jia-Bao Liu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-e4acbb3c33e44f0daad44a4a38d0cf40 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-e4acbb3c33e44f0daad44a4a38d0cf402025-02-03T06:05:12ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/53076705307670Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube NetworkJia-Bao Liu0Jing Zhao1Zhi-Yu Shi2Jinde Cao3Fuad E. Alsaadi4School of Mathematics, Southeast University, Nanjing 210096, ChinaSchool of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, ChinaSchool of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, ChinaSchool of Mathematics, Southeast University, Nanjing 210096, ChinaDepartment of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi ArabiaThe 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.http://dx.doi.org/10.1155/2020/5307670 |
| spellingShingle | Jia-Bao Liu Jing Zhao Zhi-Yu Shi Jinde Cao Fuad E. Alsaadi Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network Complexity |
| title | Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network |
| title_full | Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network |
| title_fullStr | Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network |
| title_full_unstemmed | Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network |
| title_short | Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network |
| title_sort | upper and lower bounds for the kirchhoff index of the n dimensional hypercube network |
| url | http://dx.doi.org/10.1155/2020/5307670 |
| work_keys_str_mv | AT jiabaoliu upperandlowerboundsforthekirchhoffindexofthendimensionalhypercubenetwork AT jingzhao upperandlowerboundsforthekirchhoffindexofthendimensionalhypercubenetwork AT zhiyushi upperandlowerboundsforthekirchhoffindexofthendimensionalhypercubenetwork AT jindecao upperandlowerboundsforthekirchhoffindexofthendimensionalhypercubenetwork AT fuadealsaadi upperandlowerboundsforthekirchhoffindexofthendimensionalhypercubenetwork |