Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
type: Item
instance of: scholarly article
title: Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
zbMATH Open document ID: 1347.68016
published in: Information Processing Letters
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6515006
zbMATH Keywords: paired disjoint path cover
zbMATH Keywords: fault-tolerance
zbMATH Keywords: multidimensional torus
zbMATH Keywords: Cartesian product of graphs
zbMATH Keywords: interconnection network
author: Xiebin Chen
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.10.001
OpenAlex ID: W1813111821
cites work: Q5422499
cites work: Many-to-many disjoint paths in faulty hypercubes
cites work: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
cites work: Paired many-to-many disjoint path covers of the hypercubes
cites work: The 2-path-bipanconnectivity of hypercubes
cites work: Panconnectivity and edge-pancyclicity of multidimensional torus networks
cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
cites work: Path partitions of hypercubes
cites work: Panconnectivity and edge-pancyclicity ofk-aryn-cubes
cites work: Paired many-to-many disjoint path covers in faulty hypercubes
cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
cites work: Many-to-many two-disjoint path covers in restricted hypercube-like graphs
cites work: Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
cites work: Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids
cites work: Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
cites work: Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
DOI: 10.1016/J.IPL.2015.10.001
Recommended article: Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
Recommended article: Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
Recommended article: Paired many-to-many disjoint path covers of hypercubes with faulty edges
Recommended article: Torus-like graphs and their paired many-to-many disjoint path covers
Recommended article: Paired many-to-many disjoint path covers in faulty hypercubes
Recommended article: Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
Recommended article: Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
Recommended article: Algorithms and Computation
Recommended article: Paired many-to-many disjoint path covers of hypertori
description: scientific article; zbMATH DE number 6515006