Pages that link to "Item:Q1029001"

The following pages link to Fault-tolerant cycle-embedding of crossed cubes (Q1029001):

Displaying 33 items.

• Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
• Hamilton paths and cycles in varietal hypercube networks with mixed faults (Q274757) (← 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)
• Embedding a long fault-free cycle in a crossed cube with more faulty nodes (Q656607) (← links)
• Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
• Node-pancyclicity and edge-pancyclicity of crossed cubes (Q835009) (← links)
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements (Q884473) (← links)
• Conditional fault diameter of crossed cubes (Q897397) (← links)
• Embedding of cycles in twisted cubes with edge-pancyclic (Q930597) (← 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)
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes (Q1002284) (← links)
• Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• Paths in Möbius cubes and crossed cubes (Q1045907) (← links)
• A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337) (← links)
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture (Q2333183) (← links)
• Embedding meshes into crossed cubes (Q2372214) (← links)
• Cycles passing through prescribed edges in a hypercube with some faulty edges (Q2380025) (← 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)
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) (Q2474073) (← links)
• Fault-tolerant cycle-embedding in alternating group graphs (Q2479251) (← links)
• On embedding cycles into faulty twisted cubes (Q2488628) (← links)
• The conditional diagnosability of crossed cubes under the comparison model (Q3066982) (← links)
• MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
• Constructing optimal subnetworks for the crossed cube network (Q4648694) (← links)
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn (Q6169868) (← links)