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

DOI10.1016/J.TCS.2016.04.007zbMATH Open1339.68211OpenAlexW4200017195MaRDI QIDQ284574FDOQ284574

Authors: 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

Recommendations

• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Torus-like graphs and their paired many-to-many disjoint path covers

zbMATH Keywords

disjoint pathfault toleranceinterconnection networkpath 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)

Cites Work

• Graph theory
• 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
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• On Path Cover Problems in Digraphs and Applications to Program Testing
• General-demand disjoint path covers in a graph with faulty elements
• 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
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Many-to-many disjoint paths in faulty hypercubes
• Path partitions of hypercubes
• Recursive circulants and their embeddings among hypercubes
• Title not available (Why is that?)
• One-to-one disjoint path covers on alternating group graphs
• One-to-one disjoint path covers on multi-dimensional tori
• On the generalized twisted cube
• 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

Cited In (10)

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

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

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