MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
From MaRDI portal
Publication:3144934
DOI10.1142/S0129626412500053zbMath1253.68259MaRDI QIDQ3144934
Sachin Padmanabhan, Eddie Cheng
Publication date: 12 December 2012
Published in: Parallel Processing Letters (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Connectivity of the crossed cube
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes
- Embedding meshes/tori in faulty crossed cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Fault-tolerant embedding of paths in crossed cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Conditional matching preclusion sets
- Fault-tolerant cycle-embedding of crossed cubes
- Conditional matching preclusion for hypercube-like interconnection networks
- Embedding a family of disjoint 3D meshes into a crossed cube
- Paths in Möbius cubes and crossed cubes
- Topological properties of the crossed cube architecture
- Constructing the nearly shortest path in crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Complete path embeddings in crossed cubes
- Conditional matching preclusion for the alternating group graphs and split-stars
- The conditional diagnosability of crossed cubes under the comparison model
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- On the double-vertex-cycle-connectivity of crossed cubes
- Matching preclusion for some interconnection networks
This page was built for publication: MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
