Pages that link to "Item:Q1349988"

The following pages link to Topological properties of the crossed cube architecture (Q1349988):

Displaying 21 items.

• Connectivity of the crossed cube (Q287002) (← links)
• A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions (Q555427) (← links)
• Node-pancyclicity and edge-pancyclicity of crossed cubes (Q835009) (← links)
• Conditional fault diameter of crossed cubes (Q897397) (← links)
• The two-equal-disjoint path cover problem of matching composition network (Q963388) (← links)
• The shuffle-cubes and their generalization (Q1607079) (← links)
• The super connectivity of folded crossed cubes (Q1628688) (← links)
• A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337) (← links)
• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (Q2039695) (← links)
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
• A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture (Q2333183) (← links)
• Embedding meshes into crossed cubes (Q2372214) (← links)
• Hamiltonian properties on the class of hypercube-like networks (Q2390274) (← links)
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
• Complete path embeddings in crossed cubes (Q2509240) (← links)
• Vertex-transitivity on folded crossed cubes (Q2630337) (← links)
• MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
• Constructing optimal subnetworks for the crossed cube network (Q4648694) (← links)
• Independent spanning trees in crossed cubes (Q5971214) (← links)