{"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}
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].
期刊介绍:
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