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

DOI10.1016/J.TCS.2013.10.008zbMATH Open1352.68195OpenAlexW2010322858MaRDI QIDQ391966FDOQ391966

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

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

zbMATH Keywords

graph theoryhypercubefault tolerancedisjoint path coverstrongly Hamiltonian laceability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

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

Cited In (33)

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

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)