Connectivity of the crossed cube

DOI10.1016/S0020-0190(97)00012-4zbMath1336.68008OpenAlexW2114119464MaRDI QIDQ287002

Priyalal D. Kulasinghe

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00012-4

zbMATH Keywords

fault tolerancecrossed cubevertex and edge connectivityvertex and edge disjoint paths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (31)

Edge fault tolerance analysis of a class of interconnection networks ⋮ Node-pancyclicity and edge-pancyclicity of crossed cubes ⋮ The super connectivity of folded crossed cubes ⋮ Restricted connectivity for three families of interconnection networks ⋮ Embedding meshes into crossed cubes ⋮ On the double-vertex-cycle-connectivity of crossed cubes ⋮ The \(h\)-connectivity of exchanged crossed cube ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ The cycle-structure connectivity of crossed cubes ⋮ Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Conditional fault diameter of crossed cubes ⋮ Structure connectivity of data center networks ⋮ Edge-fault tolerance of hypercube-like networks ⋮ The connectivity of exchanged crossed cube ⋮ Super connectivity of folded twisted crossed cubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Constructing optimal subnetworks for the crossed cube network ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Connectivity and super connectivity of the divide-and-swap cube ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ A class of hierarchical graphs as topologies for interconnection networks ⋮ Complete path embeddings in crossed cubes ⋮ The conditional diagnosability of crossed cubes under the comparison model ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Paths in Möbius cubes and crossed cubes ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES ⋮ The shuffle-cubes and their generalization ⋮ Independent spanning trees in crossed cubes

Cites Work

• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Topological properties of the crossed cube architecture
• On Group Graphs and Their Fault Tolerance
• Embedding binary trees into crossed cubes
• The twisted N-cube with application to multiprocessing

This page was built for publication: Connectivity of the crossed cube