{"title":"Reliability evaluation of conditional recursive networks under h-conditional restriction","authors":"Hong Zhang , Hong Bian , Jixiang Meng","doi":"10.1016/j.amc.2025.129399","DOIUrl":null,"url":null,"abstract":"<div><div>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 <em>h</em>-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 <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>l</mi></mrow></msub></math></span> (<span><math><mi>l</mi><mo>≥</mo><mn>3</mn></math></span> is an odd integer), named conditional recursive networks (simply called CRNs). It contains the common network alternating group network (<span><math><mi>A</mi><msub><mrow><mi>N</mi></mrow><mrow><mi>m</mi></mrow></msub></math></span>) and some unknown networks. In order to further reflect the reliability of composite network CRNs, we determine connectivity and <em>h</em>-conditional restricted connectivity for <span><math><mn>0</mn><mo>≤</mo><mi>h</mi><mo>≤</mo><mi>l</mi><mo>−</mo><mn>1</mn></math></span>. As an application, we get the connectivity and <em>h</em>-conditional restricted connectivity of <span><math><mi>A</mi><msub><mrow><mi>N</mi></mrow><mrow><mi>m</mi></mrow></msub></math></span> directly.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"500 ","pages":"Article 129399"},"PeriodicalIF":3.5000,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300325001262","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
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 ( is an odd integer), named conditional recursive networks (simply called CRNs). It contains the common network alternating group network () and some unknown networks. In order to further reflect the reliability of composite network CRNs, we determine connectivity and h-conditional restricted connectivity for . As an application, we get the connectivity and h-conditional restricted connectivity of directly.
期刊介绍:
Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results.
In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.