A note on path embedding in crossed cubes with faulty vertices
From MaRDI portal
Publication:509890
DOI10.1016/J.IPL.2017.01.006zbMATH Open1404.68083OpenAlexW2581481049MaRDI QIDQ509890FDOQ509890
Authors: Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai 
Publication date: 21 February 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.01.006
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Long paths in hypercubes with conditional node-faults
- The \((n,k)\)-star graph: A generalized star graph
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Path embedding in faulty hypercubes
- Linear array and ring embeddings in conditional faulty hypercubes
- Paths in Möbius cubes and crossed cubes
- Longest fault-free paths in hypercubes with vertex faults
- Optimal fault-tolerant embedding of paths in twisted cubes
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Complete path embeddings in crossed cubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Fault-tolerant embedding of paths in crossed cubes
Cited In (6)
- Fault-tolerant embedding of paths in crossed cubes
- Complete path embeddings in crossed cubes
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Optimizing Hamiltonian panconnectedness for the crossed cube architecture
This page was built for publication: A note on path embedding in crossed cubes with faulty vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509890)
