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

DOI10.1016/J.TCS.2015.11.007MaRDI QIDQ897923zbMATH OpenOpenAlexFDO

Authors Xiebin 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-tolerance\(k\)-ary \(n\)-cubeCartesian product of graphsinterconnection networkpaired 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)

Recommendations

• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Paired many-to-many disjoint path covers of the hypercubes
• Many-to-many disjoint path covers in k-ary n-cubes
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers in cubes of connected graphs
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

Cites work

• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Graph theory
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• 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 Recursive Circulants $(G(2^m,4))$
• 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
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• The 2-path-bipanconnectivity of hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

Cited in

(10)

• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
• Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Torus-like graphs and their paired many-to-many disjoint path covers
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Path coverings with prescribed ends in faulty hypercubes
• 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 faulty \(k\)-ary \(n\)-cubes

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