Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity
Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity
复制标题
DOI:
10.1016/j.tcs.2022.04.010
复制
发表时间:
2022-04
期刊:
影响因子:
--
通讯作者:
Zhaoxia Tian;Mingzu Zhang;Xing Feng
中科院分区:
文献类型:
--
作者:
Zhaoxia Tian;Mingzu Zhang;Xing Feng
As a measurement parameter of the reliability about interconnection networks of parallel and distributed systems, the h-extra edge-connectivity λ h (G) is a better alternative compared with the classical Menger's theorem of the edge-connectivity. Recently, Li and Yang (2013)[7] determined the values of the h-extra edge-connectivity of hypercube Q n for each h≤ 2⌊ n 2⌋. Because of easy scalability, the interconnection networks based on cartesian product operation are extensively investigated. This paper focuses on the h-extra edge-connectivity of the n-th cartesian product of complete graph K 4 with exponentially many faulty links. For a sufficiently large positive integer n, about 60 percent of positive integers h in the interval 1≤ h≤ 2⋅ 4 n− 1 corresponding h-extra edge-connectivity of K 4 n, λ h (K 4 n), presents a concentration phenomenon, that is, these exact values of λ h (K 4 n) concentrate on 3⋅ 4 n− 1 and 4 n for each⌈ 3⋅ 4 n− 1/5⌉≤ h≤ 4 n− 1 and⌈ 6⋅ 4 n− 1/5⌉≤ h≤ 2⋅ 4 n− 1, respectively. And the lower and upper bounds of h are sharp. Furthermore, the values of λ h (K 2 n) also have this phenomenon. We obtain λ h (K 4 n)= 3 2 λ h (K 2 2 n)= 3⋅ 4 n− 1 or λ h (K 4 n)= 2 λ h (K 2 2 n)= 4 n in the subintervals where the concentration phenomenon occurs simultaneously.