Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube

Meijie Ma, Chaoming Guo, Xiang-Jun Li
{"title":"Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube","authors":"Meijie Ma, Chaoming Guo, Xiang-Jun Li","doi":"10.1142/s0129054122500253","DOIUrl":null,"url":null,"abstract":"Menger-type problems in interconnection networks have received many attentions in recent years. A connected graph [Formula: see text] is strong Menger (edge) connected if there are [Formula: see text] vertex (edge)-disjoint paths joining any two distinct vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. Fault tolerance is an important criterion in the design of interconnection networks. The folded hypercube [Formula: see text] is an important variant of hypercube [Formula: see text] which remains many desirable properties of hypercube. We consider the strong Menger connectivity of folded hypercubes when part of the network is faulty. We show that [Formula: see text] [Formula: see text] is strong Menger (edge) connected. Which means that when a subcube [Formula: see text] is faulty, the surviving graph [Formula: see text] is strong Menger (edge) connected. This generalizes the result of [Formula: see text] in [J. Parallel Distrib. Comput. 138 (2020) 190–198].","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"250 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054122500253","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Menger-type problems in interconnection networks have received many attentions in recent years. A connected graph [Formula: see text] is strong Menger (edge) connected if there are [Formula: see text] vertex (edge)-disjoint paths joining any two distinct vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. Fault tolerance is an important criterion in the design of interconnection networks. The folded hypercube [Formula: see text] is an important variant of hypercube [Formula: see text] which remains many desirable properties of hypercube. We consider the strong Menger connectivity of folded hypercubes when part of the network is faulty. We show that [Formula: see text] [Formula: see text] is strong Menger (edge) connected. Which means that when a subcube [Formula: see text] is faulty, the surviving graph [Formula: see text] is strong Menger (edge) connected. This generalizes the result of [Formula: see text] in [J. Parallel Distrib. Comput. 138 (2020) 190–198].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有缺陷子立方体的折叠超立方体的强Menger连通性
互联网络中的menger型问题近年来受到广泛关注。一个连通图[公式:见文]是强门格尔(边)连通的,如果在[公式:见文]中存在[公式:见文]顶点(边)不相交的路径连接任意两个不同的顶点[公式:见文]和[公式:见文]。容错性是互连网络设计的一个重要标准。折叠超立方体[公式:见文]是超立方体[公式:见文]的一个重要变体,它保留了超立方体的许多理想性质。我们考虑了当网络部分故障时折叠超立方体的强门格连通性。我们证明了[Formula: see text] [Formula: see text]是强门格尔(edge)连通的。这意味着当一个子立方体[公式:见文]有缺陷时,幸存的图[公式:见文]是强门格尔(边)连通的。这推广了[J]中的[公式:见文本]的结果。Distrib平行。计算机学报,138(2020):190-198。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Hardest LL(k) Language Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface Transportation Problem Allowing Sending and Bringing Back Online and Approximate Network Construction from Bounded Connectivity Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1