Bipanconnectivity of faulty hypercubes with minimum degree
From MaRDI portal
Publication:426602
DOI10.1016/j.amc.2011.11.041zbMath1242.05194OpenAlexW2000180869MaRDI QIDQ426602
Publication date: 11 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.11.041
Related Items (3)
Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Multiple regular graph embeddings into a hypercube with unbounded expansion ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges
Cites Work
- Fault-tolerant cycle embedding in the hypercube
- Pancyclism in Chvátal-Erdős' graphs
- Longest fault-free paths in hypercubes with vertex faults
- The super laceability of the hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- A survey of the theory of hypercube graphs
- Edge-pancyclic block-intersection graphs
- The square of a block is vertex pancyclic
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Pancyclicity of claw-free Hamiltonian graphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Hamiltonian paths with prescribed edges in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Pancyclic graphs. I
- Updating the hamiltonian problem—A survey
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Embedding of cycles in arrangement graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bipanconnectivity of faulty hypercubes with minimum degree
