Many-to-many disjoint paths in hypercubes with faulty vertices
From MaRDI portal
Publication:516818
DOI10.1016/J.DAM.2016.09.013zbMath1358.05150arXiv1204.4252OpenAlexW1589576801MaRDI QIDQ516818
Jun-Ming Xu, Xiang-Jun Li, Meijie Ma, Bin Liu
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4252
Related Items (3)
Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two node-disjoint paths in balanced hypercubes
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Many-to-many disjoint paths in faulty hypercubes
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- Longest fault-free paths in hypercubes with vertex faults
- The super laceability of the hypercubes
- Path partitions of hypercubes
- The spanning connectivity of folded hypercubes
- Long paths in hypercubes with conditional node-faults
- Survey on path and cycle embedding in some networks
- A survey of the theory of hypercube graphs
- Long cycles in hypercubes with optimal number of faulty vertices
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes
- On the equitable \(k^{*}\)-laceability of hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Theory and Application of Graphs
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Many-to-many disjoint paths in hypercubes with faulty vertices
