Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
From MaRDI portal
Publication:2416418
DOI10.1016/j.dam.2019.02.033zbMath1411.05151OpenAlexW2921573783WikidataQ128257125 ScholiaQ128257125MaRDI QIDQ2416418
Publication date: 23 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.033
Related Items (5)
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
Cites Work
- Two node-disjoint paths in balanced hypercubes
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- A note on path embedding in crossed cubes with faulty vertices
- Edge-independent spanning trees in augmented cubes
- A strong connectivity property of the generalized exchanged hypercube
- Various cycles embedding in faulty balanced hypercubes
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Matching preclusion for balanced hypercubes
- A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Super connectivity of balanced hypercubes
- Strong Menger connectivity with conditional faults of folded hypercubes
- Symmetric Property and Reliability of Balanced Hypercube
- Hamiltonian-laceability of star graphs
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
