数据中心网络的循环连通性

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-07-14 DOI:10.1080/17445760.2021.1952579

Hongzhou Zhu, J. Meng

{"title":"数据中心网络的循环连通性","authors":"Hongzhou Zhu, J. Meng","doi":"10.1080/17445760.2021.1952579","DOIUrl":null,"url":null,"abstract":"Let G be a connected graph, F be a subset of , S be a subset of . The cyclic vertex connectivity of G, denoted by , is the minimum cardinality of F such that G−F is disconnected and at least two of its components contain cycles. The cyclic edge connectivity of G, denoted by , is the minimum cardinality of S such that G−S is disconnected and at least two of its components contain cycles. Let denote the data center network. In this paper, we obtain the following results: for ; for , ; for ; for ; for , .","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2021-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1952579","citationCount":"0","resultStr":"{\"title\":\"Cyclic connectivity of the data center network\",\"authors\":\"Hongzhou Zhu, J. Meng\",\"doi\":\"10.1080/17445760.2021.1952579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a connected graph, F be a subset of , S be a subset of . The cyclic vertex connectivity of G, denoted by , is the minimum cardinality of F such that G−F is disconnected and at least two of its components contain cycles. The cyclic edge connectivity of G, denoted by , is the minimum cardinality of S such that G−S is disconnected and at least two of its components contain cycles. Let denote the data center network. In this paper, we obtain the following results: for ; for , ; for ; for ; for , .\",\"PeriodicalId\":45411,\"journal\":{\"name\":\"International Journal of Parallel Emergent and Distributed Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/17445760.2021.1952579\",\"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.2021.1952579\",\"RegionNum\":0,\"RegionCategory\":null,\"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 Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2021.1952579","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

摘要

设G是连通图，F是的子集，S是的子集。G的循环顶点连通性，记作，是F的最小基数，使得G−F是不连通的，并且它的至少两个分量包含环。G的循环边连通性，记作，是S的最小基数，使得G−S是不连通的，并且它的至少两个分量包含循环。表示数据中心网络。本文得到如下结果:为;为，;为;为;对于，。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Cyclic connectivity of the data center network

Let G be a connected graph, F be a subset of , S be a subset of . The cyclic vertex connectivity of G, denoted by , is the minimum cardinality of F such that G−F is disconnected and at least two of its components contain cycles. The cyclic edge connectivity of G, denoted by , is the minimum cardinality of S such that G−S is disconnected and at least two of its components contain cycles. Let denote the data center network. In this paper, we obtain the following results: for ; for , ; for ; for ; for , .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Parallel Emergent and Distributed Systems COMPUTER SCIENCE, THEORY & METHODS-

CiteScore

2.30

自引率

0.00%

发文量