Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes

DOI10.1016/j.tcs.2015.11.007zbMath1331.68032OpenAlexW2287547725MaRDI QIDQ897923

Xie-Bin Chen

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.007

zbMATH Keywords

fault-toleranceinterconnection networkCartesian product of graphs\(k\)-ary \(n\)-cubepaired disjoint path cover

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) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ 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 ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes

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
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• 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
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

This page was built for publication: Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes