 Reliability evaluation of conditional recursive networks under h-conditional restrictionHong Zhang, Hong Bian and Jixiang Meng Applied Mathematics and Computation, 2025, vol. 500, issue C Abstract: As the number of links and processors in an interconnection network increases, faulty links and processors are constantly emerging. When a network fails, how to evaluate the state of the network and optimize the reliability of the network itself is the focus of attention in recent years. Therefore, the design of network structure and network reliability evaluation are particularly significant. In recent years, connectivity, especially h-conditional restricted connectivity, has been widely discussed by scholars. In this paper, a family of composite network is constructed on the basis of complete graph Kl (l≥3 is an odd integer), named conditional recursive networks (simply called CRNs). It contains the common network alternating group network (ANm) and some unknown networks. In order to further reflect the reliability of composite network CRNs, we determine connectivity and h-conditional restricted connectivity for 0≤h≤l−1. As an application, we get the connectivity and h-conditional restricted connectivity of ANm directly. Keywords: Conditional recursive networks; Reliability; Connectivity; Conditional restricted connectivity (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001262 DOI: 10.1016/j.amc.2025.129399 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.