Pages that link to "Item:Q4446910"

The following pages link to Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs (Q4446910):

Displaying 37 items.

• Fault-tolerance of \((n, k)\)-star networks (Q298504) (← links)
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs (Q385956) (← links)
• A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
• The conditional fault diagnosability of \((n, k)\)-star graphs (Q440955) (← links)
• Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
• Edge-fault-tolerant pancyclicity of arrangement graphs (Q508679) (← links)
• Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs (Q659782) (← links)
• Hyper Hamiltonian laceability on edge fault star graph (Q707305) (← links)
• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks (Q726341) (← links)
• Strong matching preclusion of \((n,k)\)-star graphs (Q906391) (← links)
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs (Q924149) (← links)
• One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
• Two-node-Hamiltonicity of enhanced pyramid networks (Q985080) (← links)
• Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• A kind of conditional fault tolerance of \((n, k)\)-star graphs (Q1675782) (← links)
• A complete classification of which \((n,k)\)-star graphs are Cayley graphs (Q1706438) (← links)
• Matching preclusion number in product graphs (Q1725689) (← links)
• A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← links)
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
• Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs (Q2101922) (← links)
• Maximum independent sets partition of \((n, k)\)-star graphs (Q2325197) (← links)
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079) (← links)
• Linearly many faults in Cayley graphs generated by transposition trees (Q2456457) (← links)
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076) (← links)
• Cubic planar Hamiltonian graphs of various types (Q2497475) (← links)
• Linearly many faults in \((n,k)\)-star graphs (Q2909108) (← links)
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions (Q2913947) (← links)
• AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH (Q2941089) (← links)
• Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs (Q3056376) (← links)
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks (Q3603584) (← links)
• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks (Q3645057) (← links)
• Fractional Matching Preclusion for (<i>n</i>,<i>k</i>)-Star Graphs (Q5087845) (← links)
• GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS (Q5168414) (← links)
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS (Q5291305) (← links)
• Embedding Wheel - like Networks (Q6187747) (← links)
• Integer \(k\)-matching preclusion of graphs (Q6667353) (← links)