Pages that link to "Item:Q4421206"

The following pages link to Lee distance and topological properties of k-ary n-cubes (Q4421206):

Displaying 50 items.

• \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks (Q264588) (← links)
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions (Q279915) (← links)
• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
• Conditional diagnosability of the round matching composition networks (Q346253) (← links)
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
• An approach to conditional diagnosability analysis under the PMC model and its application to torus networks (Q401484) (← links)
• Extraconnectivity of \(k\)-ary \(n\)-cube networks (Q442246) (← links)
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes (Q507588) (← links)
• \(h\)-restricted connectivity of locally twisted cubes (Q516833) (← links)
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges (Q545343) (← links)
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube (Q545386) (← links)
• Matching preclusion for \(k\)-ary \(n\)-cubes (Q608299) (← links)
• Augmented \(k\)-ary \(n\)-cubes (Q621635) (← 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)
• Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges (Q765363) (← 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)
• Fast decoding of quasi-perfect Lee distance codes (Q851766) (← links)
• Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
• Properties of a hierarchical network based on the star graph (Q985088) (← links)
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
• Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization (Q1009358) (← links)
• Some topological properties of star graphs: The surface area and volume (Q1011493) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• Algorithmic construction of Hamiltonians in pyramids (Q1603354) (← links)
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes (Q1637214) (← links)
• The edge connectivity of expanded \(k\)-ary \(n\)-cubes (Q1727252) (← links)
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes (Q1733044) (← links)
• Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\) (Q2025383) (← links)
• Embedded connectivity of ternary \(n\)-cubes (Q2031055) (← links)
• On \(k\)-ary \(n\)-cubes and isometric words (Q2089690) (← links)
• Quaternary \(n\)-cubes and isometric words (Q2140457) (← links)
• Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach (Q2162847) (← links)
• The reliability analysis of \(k\)-ary \(n\)-cube networks (Q2192376) (← links)
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube (Q2242698) (← links)
• The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes (Q2317868) (← links)
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks (Q2330113) (← links)
• Path and cycle fault tolerance of bubble-sort graph networks (Q2420577) (← links)
• Strong matching preclusion for \(k\)-ary \(n\)-cubes (Q2446897) (← links)
• 3-extra connectivity of 3-ary \(n\)-cube networks (Q2448858) (← links)
• Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network (Q2637352) (← links)
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube (Q2673958) (← links)
• Embedded edge connectivity of \(k\)-ary \(n\)-cubes (Q2680221) (← links)
• Distance magic labeling of the halved folded \(n\)-cube (Q2698004) (← links)
• EMPLOYING<i>K</i>-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION (Q2755582) (← links)
• The diagnosability of the<i>k</i>-ary<i>n</i>-cubes using the pessimistic strategy (Q2887017) (← links)