Paired many-to-many disjoint path covers in faulty hypercubes

DOI10.1016/J.TCS.2013.10.008MaRDI QIDQ391966zbMATH OpenOpenAlexFDO

Authors Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa

Publication date 13 January 2014

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

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

zbMATH Keywords

disjoint path coverfault tolerancegraph theoryhypercubestrongly Hamiltonian laceability

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) 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 theory (including graph drawing) in computer science (68R10)

Recommendations

• 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 of hypercubes with faulty edges
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs

Cites work

• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Fault-tolerant cycle embedding in the hypercube
• Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Graph theory
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian properties on the class of hypercube-like networks
• Hamiltonian-laceability of star graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Long paths and cycles in hypercubes with faulty vertices
• Longest fault-free paths in hypercubes with vertex faults
• Longest paths and cycles in faulty star graphs
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• Spanning multi-paths in hypercubes

Cited in

(41)

• One-to-one disjoint path covers in digraphs
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Torus-like graphs and their paired many-to-many disjoint path covers
• Hamiltonian paths in hypercubes with local traps
• Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Path coverings with prescribed ends in faulty hypercubes
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Algorithms for finding disjoint path covers in unit interval graphs
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Computing and Combinatorics
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Generalized Gray codes with prescribed ends
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Algorithms and Computation
• Hamiltonicity of hypercubes with faulty vertices
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• 2-edge-Hamilton-connectedness of complete hypercube-like networks
• Degree conditions for disjoint path covers in graphs
• Strong matching preclusion for folded hypercubes
• Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
• On the unit interval graphs which are paired k-disjoint path coverable
• Disjoint path covers of star graphs
• One-to-one disjoint path covers in digraphs with faulty edges
• Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
• Paired many-to-many disjoint path covers of hypertori
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

This page was built for publication: Paired many-to-many disjoint path covers in faulty hypercubes

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