On the double-vertex-cycle-connectivity of crossed cubes

DOI10.1080/1063719042000208836zbMath1087.68513OpenAlexW2005086767MaRDI QIDQ4826116

Xiaofan Yang, Graham M. Megson

Publication date: 11 November 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1063719042000208836

zbMATH Keywords

TopologyHypercubeHardwareInterconnection NetworkCrossed CubeDouble-vertex-cycle-connectivityInput/output And Data CommunicationsInterconnections

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Related Items (10)

Embedding meshes into crossed cubes ⋮ Geodesic pancyclicity and balanced pancyclicity of augmented cubes ⋮ Constructing the nearly shortest path in crossed cubes ⋮ Geodesic pancyclicity of twisted cubes ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Independent spanning trees in crossed cubes ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Edge-pancyclicity of Möbius cubes ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

• Connectivity of the crossed cube
• Embedding binary trees into crossed cubes

This page was built for publication: On the double-vertex-cycle-connectivity of crossed cubes