Pages that link to "Item:Q835009"

The following pages link to Node-pancyclicity and edge-pancyclicity of crossed cubes (Q835009):

Displaying 33 items.

• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs (Q385956) (← links)
• Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance (Q497238) (← links)
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network (Q508669) (← 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)
• Vertex-pancyclicity of augmented cubes with maximal faulty edges (Q726559) (← links)
• Path embeddings in faulty 3-ary \(n\)-cubes (Q845345) (← links)
• Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs (Q845827) (← links)
• Node-pancyclicity and edge-pancyclicity of hypercube variants (Q845952) (← links)
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements (Q884473) (← links)
• Embedding of cycles in twisted cubes with edge-pancyclic (Q930597) (← links)
• Fault-tolerant embedding of paths in crossed cubes (Q954985) (← links)
• Cycle embedding of augmented cubes (Q990439) (← links)
• Edge-fault-tolerant node-pancyclicity of twisted cubes (Q990961) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• Edge-pancyclicity of Möbius cubes (Q1044721) (← links)
• Paths in Möbius cubes and crossed cubes (Q1045907) (← links)
• On pancyclicity properties of OTIS-mesh (Q1944898) (← links)
• A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337) (← links)
• Cycles passing through prescribed edges in a hypercube with some faulty edges (Q2380025) (← links)
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes (Q2383651) (← links)
• Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
• Constructing the nearly shortest path in crossed cubes (Q2390375) (← links)
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube (Q2456377) (← 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)
• Complete path embeddings in crossed cubes (Q2509240) (← links)
• Cycles Embedding in Exchanged Crossed Cube (Q2979676) (← links)
• Panconnectivity and edge-pancyclicity of<i>k</i>-ary<i>n</i>-cubes (Q3057098) (← links)
• The conditional diagnosability of crossed cubes under the comparison model (Q3066982) (← links)
• MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn (Q6169868) (← links)