The (conditional) matroidal connectivity of varietal hypercube

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-01-14 DOI:10.1016/j.tcs.2025.115076

Lulu Yang , Shuming Zhou , Qifan Zhang , Guanqin Lian

{"title":"The (conditional) matroidal connectivity of varietal hypercube","authors":"Lulu Yang , Shuming Zhou , Qifan Zhang , Guanqin Lian","doi":"10.1016/j.tcs.2025.115076","DOIUrl":null,"url":null,"abstract":"<div><div>As multiprocessor systems continue to grow in scale, their underlying interconnection networks face increasingly challenging issues to characterize reliability and fault tolerance. Matroidal connectivity and conditional matroidal connectivity are two novel metrics that enhance network reliability by dividing the edge set into several parts and flexibly adjusting the number of faulty edges in each dimension to meet practical requirements. The <em>n</em>-dimensional varietal hypercube <span><math><mi>V</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> is vertex-transitive and edge-transitive, and it is a variant of the traditional hypercube. In this paper, we first determine the matroidal connectivity and conditional matroidal connectivity of <span><math><mi>V</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. Then we conduct a comparative analysis of <span><math><mi>V</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>'s matroidal connectivity with some kinds of conditional connectivities, namely <em>g</em>-extra edge connectivity, <em>g</em>-component edge connectivity, and <em>g</em>-super edge connectivity. Our results show that matroidal connectivity outperforms the conditional edge connectivities above, underscoring its efficiency in bolstering the fault tolerance of interconnection networks under specific conditions.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1030 ","pages":"Article 115076"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525000143","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

As multiprocessor systems continue to grow in scale, their underlying interconnection networks face increasingly challenging issues to characterize reliability and fault tolerance. Matroidal connectivity and conditional matroidal connectivity are two novel metrics that enhance network reliability by dividing the edge set into several parts and flexibly adjusting the number of faulty edges in each dimension to meet practical requirements. The n-dimensional varietal hypercube

V Q_{n}

is vertex-transitive and edge-transitive, and it is a variant of the traditional hypercube. In this paper, we first determine the matroidal connectivity and conditional matroidal connectivity of

V Q_{n}

. Then we conduct a comparative analysis of

V Q_{n}

's matroidal connectivity with some kinds of conditional connectivities, namely g-extra edge connectivity, g-component edge connectivity, and g-super edge connectivity. Our results show that matroidal connectivity outperforms the conditional edge connectivities above, underscoring its efficiency in bolstering the fault tolerance of interconnection networks under specific conditions.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.