Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements

DOI10.1142/S0129054120500148zbMath1458.68024MaRDI QIDQ4983546

No author found.

Publication date: 20 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

interconnection networksfault-tolerance\(k\)-ary \(n\)-cubedisjoint path covers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Hyper star fault tolerance of bubble sort networks ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses

Cites Work

• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• An efficient algorithm to construct disjoint path covers of DCell networks
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS

This page was built for publication: Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements