Paired 2-disjoint path covers of multidimensional torus networks with faulty edges

DOI10.1016/j.ipl.2015.10.001zbMath1347.68016OpenAlexW1813111821MaRDI QIDQ894448

Xie-Bin Chen

Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.10.001

zbMATH Keywords

fault-toleranceinterconnection networkCartesian product of graphsmultidimensional toruspaired disjoint path cover

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements

Cites Work

• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• The 2-path-bipanconnectivity of hypercubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
• Path partitions of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Panconnectivity and edge-pancyclicity ofk-aryn-cubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

This page was built for publication: Paired 2-disjoint path covers of multidimensional torus networks with faulty edges