Pages that link to "Item:Q878678"

The following pages link to Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes (Q878678):

Displaying 35 items.

• Hamiltonian cycle embedding for fault tolerance in balanced hypercubes (Q278371) (← links)
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes (Q391635) (← links)
• Embedding long cycles in faulty \(k\)-ary \(2\)-cubes (Q426579) (← links)
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes (Q508762) (← links)
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube (Q545386) (← links)
• Bipanconnectivity of balanced hypercubes (Q623108) (← links)
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements (Q629361) (← links)
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes (Q642966) (← links)
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults (Q650889) (← links)
• Fault tolerance in \(k\)-ary \(n\)-cube networks (Q690475) (← links)
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes (Q726167) (← links)
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges (Q765363) (← links)
• The preclusion numbers and edge preclusion numbers in a class of Cayley graphs (Q777422) (← links)
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks (Q781946) (← links)
• Path embeddings in faulty 3-ary \(n\)-cubes (Q845345) (← links)
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links (Q845346) (← links)
• Cycle embedding in star graphs with conditional edge faults (Q846467) (← links)
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923) (← links)
• K-restricted edge connectivity for some interconnection networks (Q945294) (← links)
• Path embedding in star graphs (Q1002273) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes (Q1637214) (← links)
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes (Q1733044) (← links)
• Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) (Q2012058) (← links)
• The reliability analysis of \(k\)-ary \(n\)-cube networks (Q2192376) (← links)
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices (Q2196925) (← links)
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
• Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes (Q2322874) (← links)
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks (Q2330113) (← links)
• Matching preclusion for \(n\)-dimensional torus networks (Q2357377) (← links)
• Strong matching preclusion for \(k\)-ary \(n\)-cubes (Q2446897) (← links)
• Fault-tolerant Hamiltonian connectedness of cycle composition networks (Q2474880) (← links)
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups (Q2512654) (← links)