当前位置: X-MOL 学术Complexity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
Complexity ( IF 1.7 ) Pub Date : 2020-06-16 , DOI: 10.1155/2020/5307670
Jia-Bao Liu 1, 2 , Jing Zhao 2 , Zhi-Yu Shi 2 , Jinde Cao 1 , Fuad E. Alsaadi 3
Affiliation  

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 .

中文翻译:

n维超立方体网络的Kirchhoff指数的上下界

超立方体由于其在某些实际应用中的出色性能而成为最令人钦佩和最有效的互连网络之一。基尔霍夫指数等于网络中任意一对顶点之间的电阻距离之和。在本文中,我们推导了关于超立方体网络的基尔霍夫指数的一些界限
更新日期:2020-06-16
down
wechat
bug