Many-to-many n-disjoint path covers in n-dimensional hypercubes

DOI10.1016/J.IPL.2010.05.004MaRDI QIDQ765483zbMATH OpenOpenAlexFDO

Authors Di Liu, Jing Li

Publication date 19 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.05.004

zbMATH Keywords

parallel computinghypercubesinterconnection networksdisjoint paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Recommendations

• Paired many-to-many disjoint path covers of the hypercubes
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Many-to-many disjoint path covers in k-ary n-cubes

Cites work

• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Graph theory
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path embedding in star graphs
• Path embeddings in faulty 3-ary \(n\)-cubes
• Path partitions of hypercubes
• Spanning multi-paths in 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

(19)

• General-demand disjoint path covers in a graph with faulty elements
• Many-to-many disjoint path covers in k-ary n-cubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• One-to-one disjoint path covers on k-ary n-cubes
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• The \(g\)-extra conditional diagnosability and sequential \(t/k\)-diagnosability of hypercubes
• One-to-one disjoint path covers on multi-dimensional tori
• 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
• The two-equal-disjoint path cover problem of matching composition network
• 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 many-to-many disjoint path covers of the hypercubes
• The 2-path-bipanconnectivity of hypercubes
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• Many-to-many disjoint paths in hypercubes with faulty vertices
• One-to-one conditional path covers on augmented cubes
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges

This page was built for publication: Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes

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