Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle

DOI10.1016/j.amc.2022.127481OpenAlexW4293215997MaRDI QIDQ2673946

Eminjan Sabir, Hongwei Qiao, Ji Xiang Meng

Publication date: 21 September 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127481

zbMATH Keywords

Hamiltonian cyclesdisjoint cyclesspanning cyclableenhanced hypercubes

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes ⋮ The disjoint path cover in the data center network HSDC with prescribed vertices in each path

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
• Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
• Solution to an open problem on 4-ordered Hamiltonian graphs
• Cycle embedding of augmented cubes
• Survey on path and cycle embedding in some networks
• Hamiltonian decompositions of Cayley graphs on Abelian groups
• The vulnerability of the diameter of folded \(n\)-cubes
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• 2-spanning cyclability problems of some generalized Petersen graphs
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
• The vulnerability of the diameter of the enhanced hypercubes
• Disjoint cycles in hypercubes with prescribed vertices in each cycle
• Pancyclic graphs. I
• Diagnosability of enhanced hypercubes

This page was built for publication: Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle