Fault-tolerant embedding of paths in crossed cubes
From MaRDI portal
(Redirected from Publication:954985)
Recommendations
- Fault-tolerant cycle-embedding of crossed cubes
- Fault tolerant path-embedding in locally twisted cubes.
- Path embedding in faulty hypercubes
- A note on path embedding in crossed cubes with faulty vertices
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Embedded paths and cycles in faulty hypercubes
- Paths and cycles embedding on enhanced hypercube with faulty vertices
- Path embeddings in faulty 3-ary \(n\)-cubes
Cites work
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1559553 (Why is no real title available?)
- Asymptotics of the average number of nondominant options of binary relations
- Complete path embeddings in crossed cubes
- Connectivity of the crossed cube
- Embedding binary trees into crossed cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Longest fault-free paths in hypercubes with vertex faults
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- On some super fault-tolerant Hamiltonian graphs
- On the double-vertex-cycle-connectivity of crossed cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Paths in Möbius cubes and crossed cubes
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
Cited in
(28)- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
- Efficient unicast in bijective connection networks with the restricted faulty node set
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- Survey on path and cycle embedding in some networks
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Conditional fault diameter of crossed cubes
- Embedding a mesh of trees in the crossed cube
- An equivalent definition of the crossed cube
- Fault-tolerant cycle-embedding of crossed cubes
- Matching preclusion and conditional matching preclusion for crossed cubes
- Complete path embeddings in crossed cubes
- Embedding meshes/tori in faulty crossed cubes
- (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
- On the double-vertex-cycle-connectivity of crossed cubes
- Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults
- Embedding meshes into twisted-cubes
- Fault tolerant path-embedding in locally twisted cubes.
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- Strong fault-Hamiltonicity for the crossed cube and its extensions
- Fault-tolerant panconnectivity of augmented cubes
- Fault tolerance in bubble-sort graph networks
- Paths in Möbius cubes and crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- One-to-one disjoint path covers on alternating group graphs
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- Constructing the nearly shortest path in crossed cubes
- A note on path embedding in crossed cubes with faulty vertices
This page was built for publication: Fault-tolerant embedding of paths in crossed cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954985)
