Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
作者：
Highlights：
• Embedding cycles into a network topology is crucial for the network simulation.
• This paper investigates the problem of embedding spanning disjoint cycles in enhanced hypercube networks with each cycle containing a prescribed vertex.
• It is shown that the n-dimensional enhanced hypercube Qn,m is k-spanning cyclable if k≤n and n≥4, and k-spanning cyclable if k≤n−1 and n=2,3. Moreover, some experimental examples are provided to verify the theoretical results.
摘要
•Embedding cycles into a network topology is crucial for the network simulation.•This paper investigates the problem of embedding spanning disjoint cycles in enhanced hypercube networks with each cycle containing a prescribed vertex.•It is shown that the n-dimensional enhanced hypercube Qn,m is k-spanning cyclable if k≤n and n≥4, and k-spanning cyclable if k≤n−1 and n=2,3. Moreover, some experimental examples are provided to verify the theoretical results.
论文关键词：Enhanced Hypercubes,Spanning cyclable,Hamiltonian cycles,Disjoint cycles
论文评审过程：Received 30 October 2021, Revised 11 August 2022, Accepted 14 August 2022, Available online 23 August 2022, Version of Record 23 August 2022.
论文官网地址：https://doi.org/10.1016/j.amc.2022.127481
