{"title":"平衡超立方体的哈密顿循环与不相连的故障边","authors":"Ting Lan, Huazhong Lü","doi":"10.1016/j.ipl.2024.106518","DOIUrl":null,"url":null,"abstract":"<div><p>The balanced hypercube <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset <em>F</em> of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> there exists a fault-free Hamiltonian cycle in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> for <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span> with <span><math><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>≤</mo><mn>5</mn><mi>n</mi><mo>−</mo><mn>7</mn></math></span> if the degree of every vertex in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> is at least two and there exist no <span><math><msub><mrow><mi>f</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-cycles in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span>. In this paper, we consider the existence of Hamiltonian cycles of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> when <em>F</em> is a matching (a set of disjoint edges), and show that each edge <span><math><mi>e</mi><mo>∉</mo><mi>F</mi></math></span> lies on a fault-free Hamiltonian cycle of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> with <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>. The number of faulty edges in <em>F</em> can be up to <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup></math></span>, which is exponential to the dimension <em>n</em>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106518"},"PeriodicalIF":0.7000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hamiltonian cycles of balanced hypercube with disjoint faulty edges\",\"authors\":\"Ting Lan, Huazhong Lü\",\"doi\":\"10.1016/j.ipl.2024.106518\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The balanced hypercube <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset <em>F</em> of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> there exists a fault-free Hamiltonian cycle in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> for <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span> with <span><math><mrow><mo>|</mo><mi>F</mi><mo>|</mo></mrow><mo>≤</mo><mn>5</mn><mi>n</mi><mo>−</mo><mn>7</mn></math></span> if the degree of every vertex in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> is at least two and there exist no <span><math><msub><mrow><mi>f</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-cycles in <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span>. In this paper, we consider the existence of Hamiltonian cycles of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> when <em>F</em> is a matching (a set of disjoint edges), and show that each edge <span><math><mi>e</mi><mo>∉</mo><mi>F</mi></math></span> lies on a fault-free Hamiltonian cycle of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>F</mi></math></span> with <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>. The number of faulty edges in <em>F</em> can be up to <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup></math></span>, which is exponential to the dimension <em>n</em>.</p></div>\",\"PeriodicalId\":56290,\"journal\":{\"name\":\"Information Processing Letters\",\"volume\":\"187 \",\"pages\":\"Article 106518\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020019024000486\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000486","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Hamiltonian cycles of balanced hypercube with disjoint faulty edges
The balanced hypercube , a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset F of there exists a fault-free Hamiltonian cycle in for with if the degree of every vertex in is at least two and there exist no -cycles in . In this paper, we consider the existence of Hamiltonian cycles of when F is a matching (a set of disjoint edges), and show that each edge lies on a fault-free Hamiltonian cycle of with . The number of faulty edges in F can be up to , which is exponential to the dimension n.
期刊介绍:
Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered.
Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.