交替组网络的结构容错性

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Foundations of Computer Science Pub Date : 2023-06-23 DOI:10.1142/s0129054123500120
Huifen Ge, Shumin Zhang, Chengfu Ye
{"title":"交替组网络的结构容错性","authors":"Huifen Ge, Shumin Zhang, Chengfu Ye","doi":"10.1142/s0129054123500120","DOIUrl":null,"url":null,"abstract":"The alternating group network [Formula: see text] can be used to model the topology structure of a large-scale parallel network system. In this work, the structure fault tolerance of alternating group networks based on the star and path structures is investigated. For a graph [Formula: see text] and its a connected subgraph [Formula: see text], the [Formula: see text]-structure connectivity [Formula: see text] (resp. [Formula: see text]-substructure connectivity [Formula: see text]) of [Formula: see text] is the cardinality of a minimum family [Formula: see text] whose every element is isomorphic to [Formula: see text] (resp. isomorphic to a subgraph of [Formula: see text]) such that [Formula: see text] is disconnected. Specifically, we determine [Formula: see text] and [Formula: see text] for [Formula: see text].","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Structure Fault Tolerance of Alternating Group Networks\",\"authors\":\"Huifen Ge, Shumin Zhang, Chengfu Ye\",\"doi\":\"10.1142/s0129054123500120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The alternating group network [Formula: see text] can be used to model the topology structure of a large-scale parallel network system. In this work, the structure fault tolerance of alternating group networks based on the star and path structures is investigated. For a graph [Formula: see text] and its a connected subgraph [Formula: see text], the [Formula: see text]-structure connectivity [Formula: see text] (resp. [Formula: see text]-substructure connectivity [Formula: see text]) of [Formula: see text] is the cardinality of a minimum family [Formula: see text] whose every element is isomorphic to [Formula: see text] (resp. isomorphic to a subgraph of [Formula: see text]) such that [Formula: see text] is disconnected. Specifically, we determine [Formula: see text] and [Formula: see text] for [Formula: see text].\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054123500120\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/s0129054123500120","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

交替群网络[公式:见正文]可用于对大规模并行网络系统的拓扑结构进行建模。本文研究了基于星形和路径结构的交替群网络的结构容错问题。对于图[公式:见文本]及其连接子图[公式,见文本],[公式:参见文本]的[公式:见文本]-结构连通性[公式:参阅文本](分别为[公式:请参见文本]-子结构连通性]公式:请参阅文本])是最小族[公式:查看文本]的基数,该最小族的每个元素同构于[公式:看文本](相应地同构于[方程式:请参见正文]的子图),使得[公式:看到文本]断开。具体来说,我们确定[公式:见文本]和[公式:看文本]作为[公式:见图文本]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Structure Fault Tolerance of Alternating Group Networks
The alternating group network [Formula: see text] can be used to model the topology structure of a large-scale parallel network system. In this work, the structure fault tolerance of alternating group networks based on the star and path structures is investigated. For a graph [Formula: see text] and its a connected subgraph [Formula: see text], the [Formula: see text]-structure connectivity [Formula: see text] (resp. [Formula: see text]-substructure connectivity [Formula: see text]) of [Formula: see text] is the cardinality of a minimum family [Formula: see text] whose every element is isomorphic to [Formula: see text] (resp. isomorphic to a subgraph of [Formula: see text]) such that [Formula: see text] is disconnected. Specifically, we determine [Formula: see text] and [Formula: see text] for [Formula: see text].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science 工程技术-计算机:理论方法
CiteScore
1.60
自引率
12.50%
发文量
63
审稿时长
3 months
期刊介绍: The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing
期刊最新文献
The 4-Set Tree Connectivity of Folded Hypercube An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem State Complexity of Boolean Operations on Graph-Walking Automata Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets
×
引用
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