{"title":"The generalized measure of edge fault tolerance in exchanged 3-ary n-cube","authors":"Yayu Yang, Mingzu Zhang, J. Meng","doi":"10.1080/17445760.2023.2172575","DOIUrl":null,"url":null,"abstract":"The exchanged 3-ary n-cube , proposed by Lv et al. in 2021, is obtained by removing edges from a 3-ary n-cube , where r + s + t + 1 = n. The topological interconnection network of a multiprocessor system can be modeled as a connected graph. Analyzing the fault tolerance of its topological structure is critical in the course of design and maintenance of it. Given a connected graph G, let F be an edge subset of G. F is called an h-edge-cut of G, if G−F is disconnected and each remaining component has the minimum degree of at least h. The h-edge-connectivity is the minimum cardinality of all h-edge-cuts of G. For and , in this paper, we determine the -edge-connectivity of exchanged 3-ary n-cubes, , and prove the exact values . GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2023.2172575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The exchanged 3-ary n-cube , proposed by Lv et al. in 2021, is obtained by removing edges from a 3-ary n-cube , where r + s + t + 1 = n. The topological interconnection network of a multiprocessor system can be modeled as a connected graph. Analyzing the fault tolerance of its topological structure is critical in the course of design and maintenance of it. Given a connected graph G, let F be an edge subset of G. F is called an h-edge-cut of G, if G−F is disconnected and each remaining component has the minimum degree of at least h. The h-edge-connectivity is the minimum cardinality of all h-edge-cuts of G. For and , in this paper, we determine the -edge-connectivity of exchanged 3-ary n-cubes, , and prove the exact values . GRAPHICAL ABSTRACT
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
