Note on reliability evaluation of arrangement graphs

Xiang-Jun Li, Xue-Qian Zeng and Jun-Ming Xu

Applied Mathematics and Computation, 2022, vol. 418, issue C

Abstract: The Rh-restricted connectivity κh is a significant measurement to estimate the reliability of large-scale processor system. The arrangement graph An,k is a generalization and also a competitive alternative of the star graph Sn. In this paper, for any non-negative integer h≤n−2, we determine that κh(An,2)=n(n−2)/2 provided h is odd with h=n−3, otherwise κh(An,2)=(h+2)(n−2)−⌊h2/2+h⌋. This result implies the upper bound of κh(An,k) given by Cheng et al. (J. Supercomput., 73(8)(2017) 3669–3682) is not optimal in a sense.

Keywords: Reliability; Fault tolerance; Restricted connectivity; Arrangement graph (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321009280
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:418:y:2022:i:c:s0096300321009280

DOI: 10.1016/j.amc.2021.126845

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().