{"title":"Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks","authors":"M. Lu, Shurong Zhang, Weihua Yang","doi":"10.1142/S0129626418500135","DOIUrl":null,"url":null,"abstract":"It is well known that an [Formula: see text]-dimensional torus [Formula: see text] is Hamiltonian. Then the torus [Formula: see text] contains a spanning subgraph which is 2-regular and 2-connected. In this paper, we explore a strong property of torus networks. We prove that for any even integer [Formula: see text] with [Formula: see text], the torus [Formula: see text] contains a spanning subgraph which is [Formula: see text]-regular, k-connected and bipancyclic; and if [Formula: see text] is odd, the result holds when some [Formula: see text] is even.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129626418500135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
It is well known that an [Formula: see text]-dimensional torus [Formula: see text] is Hamiltonian. Then the torus [Formula: see text] contains a spanning subgraph which is 2-regular and 2-connected. In this paper, we explore a strong property of torus networks. We prove that for any even integer [Formula: see text] with [Formula: see text], the torus [Formula: see text] contains a spanning subgraph which is [Formula: see text]-regular, k-connected and bipancyclic; and if [Formula: see text] is odd, the result holds when some [Formula: see text] is even.
众所周知,一个[公式:见文]维环面[公式:见文]是哈密顿的。那么环面[公式:见正文]包含一个2正则2连通的生成子图。本文探讨环面网络的一个强性质。我们用[公式:见文]证明了对于任意偶数[公式:见文],环面[公式:见文]包含一个生成子图,该子图为[公式:见文]-正则,k连通,双环;如果[Formula: see text]是奇数,当[Formula: see text]是偶数时,结果成立。