Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes

DOI10.1016/J.IPL.2010.05.004zbMath1234.68020OpenAlexW2071041152MaRDI QIDQ765483

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

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

Related Items (15)

Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ 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 ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ Unnamed Item ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ General-demand disjoint path covers in a graph with faulty elements ⋮ 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 ⋮ Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Unnamed Item
• Many-to-many disjoint paths in faulty hypercubes
• Path embeddings in faulty 3-ary \(n\)-cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The two-equal-disjoint path cover problem of matching composition network
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Path partitions of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Path embedding in star graphs
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Spanning multi-paths in hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

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