Paired many-to-many disjoint path covers of the hypercubes

DOI10.1016/J.INS.2013.02.028MaRDI QIDQ2446439zbMATH OpenOpenAlexFDO

Authors Xiebin Chen

Publication date 16 April 2014

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.02.028

zbMATH Keywords

disjoint pathsHamiltonian pathhypercubeinterconnection networksmany-to-many disjoint path cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Paired many-to-many disjoint path covers in faulty hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Many-to-many disjoint paths in faulty hypercubes

Cites work

• A survey of the theory of hypercube graphs
• Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements
• Graph theory with applications
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• 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
• Survey on path and cycle embedding in some networks
• 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

(40)

• Matchings and paths in the cube
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• One-to-one disjoint path covers in digraphs
• 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
• 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
• Algorithms for finding disjoint path covers in unit interval graphs
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Path coverings with prescribed ends of the n-dimensional binary hypercube
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• 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
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• The proofs of two directed paths conjectures of Bollobás and Leader
• Hamiltonicity of hypercubes with faulty vertices
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• One-to-one disjoint path covers on k-ary n-cubes
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• Degree conditions for disjoint path covers in graphs
• 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
• Hamiltonicity of random subgraphs of the hypercube
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
• Paired many-to-many disjoint path covers of hypertori
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• 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
• Path partitions of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

This page was built for publication: Paired many-to-many disjoint path covers of the hypercubes

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