Connectivity of the crossed cube
From MaRDI portal
Publication:287002
DOI10.1016/S0020-0190(97)00012-4zbMATH Open1336.68008OpenAlexW2114119464MaRDI QIDQ287002FDOQ287002
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
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
Cited In (37)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
- A comment on ``Independent spanning trees in crossed cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Independent spanning trees in crossed cubes
- A class of hierarchical graphs as topologies for interconnection networks
- On the double-vertex-cycle-connectivity of crossed cubes
- Title not available (Why is that?)
- The connectivity of exchanged crossed cube
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Structure connectivity of data center networks
- Connectivity and super connectivity of the divide-and-swap cube
- Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern
- Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
- Constructing optimal subnetworks for the crossed cube network
- The super connectivity of exchanged crossed cube
- Fault-tolerant embedding of paths in crossed cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Paths in MΓΆbius cubes and crossed cubes
- Edge-fault tolerance of hypercube-like networks
- Complete path embeddings in crossed cubes
- The shuffle-cubes and their generalization
- Edge fault tolerance analysis of a class of interconnection networks
- Restricted connectivity for three families of interconnection networks
- The super connectivity of folded crossed cubes
- Embedding meshes into crossed cubes
- The flip-graph of the 4-dimensional cube is connected
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Conditional fault diameter of crossed cubes
- Connectivity and constructive algorithms of disjoint paths in dragonfly networks
- The conditional diagnosability of crossed cubes under the comparison model
- Structure connectivity and substructure connectivity of the crossed cube
- Embedding a family of disjoint 3D meshes into a crossed cube
- The \(h\)-connectivity of exchanged crossed cube
- A note of reliability analysis of \(SM\)-\(\lambda\) in folded-crossed hypercube with conditional faults
- The generalized \(3\)-connectivity of exchanged crossed cube
- The cycle-structure connectivity of crossed cubes
- Super connectivity of folded twisted crossed cubes
Recommendations
- The connectivity of exchanged crossed cube π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- The cycle-structure connectivity of crossed cubes π π
- Structure connectivity and substructure connectivity of the crossed cube π π
- Connectivity of cubical polytopes π π
- The super connectivity of folded crossed cubes π π
- The super connectivity of exchanged crossed cube π π
- The \(h\)-connectivity of exchanged crossed cube π π
- On the double-vertex-cycle-connectivity of crossed cubes π π
This page was built for publication: Connectivity of the crossed cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287002)