On the double-vertex-cycle-connectivity of crossed cubes
From MaRDI portal
Publication:4826116
DOI10.1080/1063719042000208836zbMath1087.68513MaRDI 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
Topology; Hypercube; Hardware; Interconnection Network; Crossed Cube; Double-vertex-cycle-connectivity; Input/output And Data Communications; Interconnections
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M99: Computer system organization
Related Items
Independent spanning trees in crossed cubes, Geodesic pancyclicity of twisted cubes, Geodesic pancyclicity and balanced pancyclicity of augmented cubes, Fault-tolerant embedding of paths in crossed cubes, Embedding a family of disjoint multi-dimensional meshes into a crossed cube, Embedding a family of disjoint 3D meshes into a crossed cube, Edge-pancyclicity of Möbius cubes, Embedding meshes into crossed cubes, Constructing the nearly shortest path in crossed cubes, MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
