Pages that link to "Item:Q985082"

The following pages link to Conditional edge-fault Hamiltonicity of augmented cubes (Q985082):

Displaying 28 items.

• Strong matching preclusion for augmented cubes (Q387805) (← links)
• Conditional edge-fault pancyclicity of augmented cubes (Q392181) (← links)
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes (Q476903) (← links)
• Hamiltonian properties of honeycomb meshes (Q497228) (← links)
• The Hamiltonian properties of supergrid graphs (Q497690) (← links)
• Fault-tolerant cycles embedding in hypercubes with faulty edges (Q507746) (← links)
• Vertex-fault-tolerant cycles embedding in balanced hypercubes (Q508760) (← links)
• Various cycles embedding in faulty balanced hypercubes (Q527210) (← links)
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
• \(\omega \)-wide diameters of enhanced pyramid networks (Q551195) (← links)
• Bipanconnectivity of balanced hypercubes (Q623108) (← links)
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes (Q638549) (← links)
• Maximally local connectivity and connected components of augmented cubes (Q726407) (← links)
• The panpositionable panconnectedness of augmented cubes (Q991906) (← links)
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes (Q1685964) (← links)
• Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks (Q1735685) (← links)
• Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges (Q1761611) (← links)
• Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
• An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
• Regular connected bipancyclic spanning subgraphs of hypercubes (Q2428990) (← links)
• Fault tolerance in the arrangement graphs (Q2446107) (← links)
• The spanning laceability on the faulty bipartite hypercube-like networks (Q2451446) (← links)
• Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
• Hamiltonian cycles of balanced hypercube with more faulty edges (Q2682937) (← links)
• Conditional fault tolerance in a class of Cayley graphs (Q2804867) (← links)
• An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
• Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes (Q6038696) (← links)