A note on path embedding in crossed cubes with faulty vertices

DOI10.1016/J.IPL.2017.01.006zbMath1404.68083OpenAlexW2581481049MaRDI QIDQ509890

Kung-Jui Pai, Yue-Li Wang, Hon-Chan Chen, Yun-Hao Zou

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)

Related Items (4)

Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ 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 ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture

Cites Work

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

This page was built for publication: A note on path embedding in crossed cubes with faulty vertices