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

DOI10.1016/J.IPL.2015.10.001MaRDI QIDQ894448zbMATH OpenOpenAlexFDO

Authors Xiebin 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-toleranceCartesian product of graphsinterconnection networkmultidimensional toruspaired 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) Graph operations (line graphs, products, etc.) (05C76) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Torus-like graphs and their paired many-to-many disjoint path covers
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Algorithms and Computation
• Paired many-to-many disjoint path covers of hypertori

Cites work

• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Graph theory
• Hamiltonian cycles passing through linear forests in k-ary n-cubes
• Many-to-many disjoint path covers in k-ary n-cubes
• Many-to-many disjoint paths in faulty hypercubes
• 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 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of the hypercubes
• Panconnectivity and edge-pancyclicity of k-ary n-cubes
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Panconnectivity of n-dimensional torus networks with faulty vertices and edges
• Pancyclicity of k-ary n-cube networks with faulty vertices and edges
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• The 2-path-bipanconnectivity of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

Cited in

(13)

• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on multi-dimensional tori
• The two-equal-disjoint path cover problem of matching composition network
• Paired many-to-many disjoint path covers of hypertori
• Panconnectivity of n-dimensional torus networks with faulty vertices and edges
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
• k-edge-Hamilton-laceable bipartite graphs
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Torus-like graphs and their paired many-to-many disjoint path covers
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
• Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894448)