{"title":"平衡超立方体的一些性质","authors":"Hui-Wen Cheng, Jin-Xin Zhou","doi":"10.1142/s0219265921500249","DOIUrl":null,"url":null,"abstract":"As a variant of [Formula: see text], Huang and Wu in [IEEE Transactions on Computers 46 (1997) 484–490] introduced the balanced hypercube [Formula: see text] as an interconnection network topology for computing systems. In this paper, we show that [Formula: see text] is a lexicographic product of two graphs, and using this, we show that every minimum cyclic vertex-cut of [Formula: see text] isolates a 4-cycle, and prove that the edge neighbor connectivity of [Formula: see text] is [Formula: see text].","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Properties of the Balanced Hypercube\",\"authors\":\"Hui-Wen Cheng, Jin-Xin Zhou\",\"doi\":\"10.1142/s0219265921500249\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a variant of [Formula: see text], Huang and Wu in [IEEE Transactions on Computers 46 (1997) 484–490] introduced the balanced hypercube [Formula: see text] as an interconnection network topology for computing systems. In this paper, we show that [Formula: see text] is a lexicographic product of two graphs, and using this, we show that every minimum cyclic vertex-cut of [Formula: see text] isolates a 4-cycle, and prove that the edge neighbor connectivity of [Formula: see text] is [Formula: see text].\",\"PeriodicalId\":153590,\"journal\":{\"name\":\"J. Interconnect. Networks\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Interconnect. Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265921500249\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Interconnect. Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265921500249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
作为[公式:见文本]的一个变体，Huang和Wu在[IEEE Transactions on Computers 46(1997) 484-490]中介绍了平衡超立方体[公式:见文本]作为计算系统的互连网络拓扑。本文证明了[公式:见文]是两个图的字典积，并以此证明了[公式:见文]的每一个最小环顶点切割都隔离了一个4环，证明了[公式:见文]的边邻连通性为[公式:见文]。
As a variant of [Formula: see text], Huang and Wu in [IEEE Transactions on Computers 46 (1997) 484–490] introduced the balanced hypercube [Formula: see text] as an interconnection network topology for computing systems. In this paper, we show that [Formula: see text] is a lexicographic product of two graphs, and using this, we show that every minimum cyclic vertex-cut of [Formula: see text] isolates a 4-cycle, and prove that the edge neighbor connectivity of [Formula: see text] is [Formula: see text].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
