Pages that link to "Item:Q4421228"

The following pages link to Embedding binary trees into crossed cubes (Q4421228):

Displaying 35 items.

• Connectivity of the crossed cube (Q287002) (← links)
• Embedding a mesh of trees in the crossed cube (Q436621) (← links)
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
• Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions (Q555427) (← links)
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube (Q621616) (← links)
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive (Q674294) (← links)
• Node-pancyclicity and edge-pancyclicity of crossed cubes (Q835009) (← links)
• Complete binary trees embeddings in Möbius cubes (Q896018) (← links)
• Conditional fault diameter of crossed cubes (Q897397) (← links)
• Embedding of cycles in twisted cubes with edge-pancyclic (Q930597) (← links)
• Embedding of meshes in Möbius cubes (Q935162) (← links)
• Fault-tolerant embedding of paths in crossed cubes (Q954985) (← links)
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube (Q975501) (← links)
• Path embedding in star graphs (Q1002273) (← links)
• Fault-tolerant cycle-embedding of crossed cubes (Q1029001) (← links)
• Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688) (← links)
• Paths in Möbius cubes and crossed cubes (Q1045907) (← links)
• The twisted-cube connected networks (Q1288440) (← links)
• The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model (Q1725692) (← links)
• \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) (Q2144839) (← links)
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture (Q2333183) (← links)
• Embedding meshes into crossed cubes (Q2372214) (← links)
• Constructing the nearly shortest path in crossed cubes (Q2390375) (← links)
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
• Edge-pancyclicity and path-embeddability of bijective connection graphs (Q2466094) (← links)
• On embedding cycles into faulty twisted cubes (Q2488628) (← links)
• Complete path embeddings in crossed cubes (Q2509240) (← links)
• Constructing optimal subnetworks for the crossed cube network (Q4648694) (← links)
• On the double-vertex-cycle-connectivity of crossed cubes (Q4826116) (← links)
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
• Fault-Tolerant Panconnectivity of Augmented Cubes AQn (Q5207034) (← links)
• Independent spanning trees in crossed cubes (Q5971214) (← links)
• Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity (Q6090299) (← links)