首页|Note on reliability evaluation of arrangement graphs
Note on reliability evaluation of arrangement graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The R-h-restricted connectivity & UKappa;(h) is a significant measurement to estimate the reliability of large-scale processor system. The arrangement graph A(n,k) is a generalization and also a competitive alternative of the star graph S-n. In this paper, for any non-negative integer h & LE; n - 2 , we determine that & UKappa;(h) (A(n, 2)) = n(n - 2) / 2 provided h is odd with h = n - 3 , otherwise & UKappa;(h) (A(n,2)) = (h + 2)(n - 2) - left perpendicularh(2)/2 + hright perpendicular. This result implies the upper bound of & UKappa;(h) (A(n,k)) given by Cheng et al. (J. Supercomput., 73(8)(2017) 3669-3682) is not optimal in a sense. (c) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
