Fault-tolerant embedding of paths in crossed cubes
From MaRDI portal
Publication:954985
DOI10.1016/J.TCS.2008.05.002zbMATH Open1152.68010OpenAlexW2076455679MaRDI QIDQ954985FDOQ954985
Authors: Meijie Ma, Jun-Ming Xu, Guizhen 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
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
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- Fault-tolerant cycle-embedding of crossed cubes
- Paths in Möbius cubes and crossed cubes
- On some super fault-tolerant Hamiltonian graphs
- Longest fault-free paths in hypercubes with vertex faults
- Optimal fault-tolerant embedding of paths in twisted cubes
- Connectivity of the crossed cube
- Embedding binary trees into crossed cubes
- On the double-vertex-cycle-connectivity of crossed cubes
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Complete path embeddings in crossed cubes
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
- Asymptotics of the average number of nondominant options of binary relations
- Title not available (Why is that?)
Cited In (25)
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- Fault tolerance in \(k\)-ary \(n\)-cube networks
- (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
- Efficient unicast in bijective connection networks with the restricted faulty node set
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Fault-tolerant panconnectivity of augmented cubes
- On the double-vertex-cycle-connectivity of crossed cubes
- Survey on path and cycle embedding in some networks
- One-to-one disjoint path covers on alternating group graphs
- Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
- Embedding a mesh of trees in the crossed cube
- Fault-tolerant cycle-embedding of crossed cubes
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- Paths in Möbius cubes and crossed cubes
- Complete path embeddings in crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- An equivalent definition of the crossed cube
- Matching preclusion and conditional matching preclusion for crossed cubes
- Embedding meshes into twisted-cubes
- Embedding meshes/tori in faulty crossed cubes
- A note on path embedding in crossed cubes with faulty vertices
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes
- Fault tolerance in bubble-sort graph networks
- Constructing the nearly shortest path in crossed cubes
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
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)
