A note on path embedding in crossed cubes with faulty vertices

DOI10.1016/J.IPL.2017.01.006MaRDI QIDQ509890zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

automorphismfault tolerancecrossed cubevertex-transitivepath embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Fault-tolerant embedding of paths in crossed cubes
• Path embedding in faulty hypercubes
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a long fault-free cycle in a crossed cube with more faulty nodes
• Complete path embeddings in crossed cubes

Cites work

• Complete path embeddings in crossed cubes
• Fault-tolerant embedding of paths in crossed cubes
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Linear array and ring embeddings in conditional faulty hypercubes
• Long paths in hypercubes with conditional node-faults
• Longest fault-free paths in hypercubes with vertex faults
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Optimal fault-tolerant embedding of paths in twisted cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Path embedding in faulty hypercubes
• Paths in Möbius cubes and crossed cubes
• The (n,k)-star graph: A generalized star graph

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)