Long paths in hypercubes with conditional node-faults
From MaRDI portal
Publication:1010144
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3641471 (Why is no real title available?)
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Embedding meshes into crossed cubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Fault-tolerant cycle embedding in the hypercube
- Graph theory
- Hamiltonian-laceability of star graphs
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Longest fault-free paths in hypercubes with vertex faults
- Node-disjoint paths in hierarchical hypercube networks
- On embedding cycles into faulty twisted cubes
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
Cited in
(31)- Efficient unicast in bijective connection networks with the restricted faulty node set
- The 2-path-bipanconnectivity of hypercubes
- Survey on path and cycle embedding in some networks
- Long cycles in hypercubes with optimal number of faulty vertices
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
- Longest fault-free paths in hypercubes with vertex faults
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Computational complexity of long paths and cycles in faulty hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- The triangular pyramid: Routing and topological properties
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
- Hamiltonian paths in hypercubes with local traps
- The panpositionable panconnectedness of augmented cubes
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- Fault-tolerant cycle embedding in the faulty hypercubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Hamiltonian cycles in hypercubes with faulty edges
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Hamiltonian laceability in hypercubes with faulty edges
- Conditional edge-fault Hamiltonicity of augmented cubes
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- A note on path embedding in crossed cubes with faulty vertices
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
- Hamiltonian properties on a class of circulant interconnection networks
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
This page was built for publication: Long paths in hypercubes with conditional node-faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010144)