Pages that link to "Item:Q819312"

The following pages link to Longest fault-free paths in hypercubes with vertex faults (Q819312):

Displaying 39 items.

• Two node-disjoint paths in balanced hypercubes (Q279509) (← links)
• Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
• Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
• Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
• One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
• The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• Odd cycles embedding on folded hypercubes with conditional faulty edges (Q507751) (← links)
• A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
• Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
• Fault-tolerant edge-pancyclicity of locally twisted cubes (Q545346) (← links)
• Efficient unicast in bijective connection networks with the restricted faulty node set (Q545351) (← links)
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
• Super \(\lambda_3\)-optimality of regular graphs (Q659824) (← links)
• Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← links)
• Long paths and cycles in hypercubes with faulty vertices (Q730940) (← links)
• Long paths in hypercubes with a quadratic number of faults (Q730952) (← links)
• Super \(p\)-restricted edge connectivity of line graphs (Q730960) (← links)
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
• Path embeddings in faulty 3-ary \(n\)-cubes (Q845345) (← links)
• On reliability of the folded hypercubes (Q881847) (← links)
• Hamiltonian laceability of bubble-sort graphs with edge faults (Q881895) (← links)
• Fault-tolerant embedding of paths in crossed cubes (Q954985) (← links)
• Two-node-Hamiltonicity of enhanced pyramid networks (Q985080) (← links)
• Path embedding in faulty hypercubes (Q990515) (← links)
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
• On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
• Long paths in hypercubes with conditional node-faults (Q1010144) (← links)
• Hamiltonian connectivity of the WK-recursive network with faulty nodes (Q1031676) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
• Long cycles in hypercubes with optimal number of faulty vertices (Q1928522) (← links)
• Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) (Q1989359) (← links)
• Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
• Embedding meshes into crossed cubes (Q2372214) (← links)
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
• Node-disjoint paths in hierarchical hypercube networks (Q2384539) (← links)
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076) (← links)