Fault-tolerant embedding of paths in crossed cubes
From MaRDI portal
Publication:954985
DOI10.1016/j.tcs.2008.05.002zbMath1152.68010OpenAlexW2076455679MaRDI QIDQ954985
Meijie Ma, Jun-Ming Xu, Gui Zhen Liu
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.002
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
\((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ Embedding a mesh of trees in the crossed cube ⋮ Embedding a long fault-free cycle in a crossed cube with more faulty nodes ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ Embedding meshes into twisted-cubes ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Fault tolerance in bubble-sort graph networks ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ Survey on path and cycle embedding in some networks ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
- Unnamed Item
- Unnamed Item
- Connectivity of the crossed cube
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Longest fault-free paths in hypercubes with vertex faults
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Paths in Möbius cubes and crossed cubes
- Asymptotics of the average number of nondominant options of binary relations
- On some super fault-tolerant Hamiltonian graphs
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Complete path embeddings in crossed cubes
- Embedding binary trees into crossed cubes
- On the double-vertex-cycle-connectivity of crossed cubes
