Paired many-to-many disjoint path covers in restricted hypercube-like graphs

DOI10.1016/j.tcs.2016.04.007zbMath1339.68211OpenAlexW4200017195MaRDI QIDQ284574

Jung-Heum Park

Publication date: 18 May 2016

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

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

zbMATH Keywords

fault toleranceinterconnection networkdisjoint pathpath coverpath partitionhypercube-like graph

Mathematics Subject Classification ID

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

Related Items (6)

How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

Cites Work

• Unnamed Item
• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• One-to-one disjoint path covers on alternating group graphs
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• On the generalized twisted cube
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Recursive circulants and their embeddings among hypercubes
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Single-source three-disjoint path covers in cubes of connected graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• General-demand disjoint path covers in a graph with faulty elements
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• One-to-one disjoint path covers on multi-dimensional tori
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

This page was built for publication: Paired many-to-many disjoint path covers in restricted hypercube-like graphs