Edge-disjoint Hamiltonian cycles of balanced hypercubes
From MaRDI portal
Publication:1721931
DOI10.1016/j.ipl.2018.12.004zbMath1478.68252OpenAlexW2904589382WikidataQ128787435 ScholiaQ128787435MaRDI QIDQ1721931
Publication date: 13 February 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.12.004
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Two node-disjoint paths in balanced hypercubes
- Disjoint Hamiltonian cycles in recursive circulant graphs
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Bipanconnectivity of balanced hypercubes
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- Matching preclusion for balanced hypercubes
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Super connectivity of balanced hypercubes
- Conditional diagnosability of balanced hypercubes under the PMC model
- Symmetric Property and Reliability of Balanced Hypercube
- Edge Disjoint Hamiltonian Cycles in Gaussian Networks
- On extra connectivity and extra edge-connectivity of balanced hypercubes
This page was built for publication: Edge-disjoint Hamiltonian cycles of balanced hypercubes