Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
From MaRDI portal
Publication:2383651
DOI10.1016/j.amc.2006.12.036zbMath1161.94012OpenAlexW2110168408MaRDI QIDQ2383651
Min Xu, Xiao-Dong Hu, Jun-Ming Xu
Publication date: 19 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.12.036
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (35)
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes ⋮ Two node-disjoint paths in balanced hypercubes ⋮ Vertex-bipancyclicity of the generalized honeycomb tori ⋮ On the edge-hyper-Hamiltonian laceability of balanced hypercubes ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Matching preclusion for balanced hypercubes ⋮ Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes ⋮ Bipanconnectivity of balanced hypercubes ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ The Kirchhoff index of some combinatorial networks ⋮ Super connectivity of balanced hypercubes ⋮ The vertex-pancyclicity of data center networks ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes ⋮ Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ Structure and substructure connectivity of balanced hypercubes ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Fault-tolerant Hamiltonian laceability of balanced hypercubes ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Edge-fault-tolerant node-pancyclicity of twisted cubes ⋮ The genus of the balanced hypercube ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Survey on path and cycle embedding in some networks ⋮ Path embeddings with prescribed edge in the balanced hypercube network ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Edge-pancyclic block-intersection graphs
- The square of a block is vertex pancyclic
- Cycles in the cube-connected cycles graph
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- Pancyclic graphs. I
This page was built for publication: Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
