Paired many-to-many disjoint path covers of hypercubes with faulty edges
DOI10.1016/J.IPL.2011.10.010zbMATH Open1233.68028OpenAlexW1984834024MaRDI QIDQ763493FDOQ763493
Authors: Xiebin Chen 
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.010
Recommendations
- Many-to-many disjoint paths in faulty hypercubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Paired many-to-many disjoint path covers of the hypercubes
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Long paths in hypercubes with conditional node-faults
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Many-to-many disjoint paths in faulty hypercubes
- Path partitions of hypercubes
- Path embedding in faulty hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- A survey of the theory of hypercube graphs
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- The two-equal-disjoint path cover problem of matching composition network
- Long paths in hypercubes with a quadratic number of faults
- Spanning multi-paths in hypercubes
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Cited In (27)
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Spanning paths in hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Hamiltonian cycles in hypercubes with more faulty edges
- Path coverings with prescribed ends in faulty hypercubes
- Changing the diameter of the locally twisted cube
- Hamiltonian paths in hypercubes with local traps
- One-to-one disjoint path covers on alternating group graphs
- Edge-disjoint paths in faulty hypercube-like networks.
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Paired many-to-many disjoint path covers of hypertori
- Computing and Combinatorics
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Paired many-to-many disjoint path covers of the hypercubes
- The super spanning connectivity and super spanning laceability of tori with faulty elements
- Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
- Edge‐cutsets in the directed hypercube
- 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
This page was built for publication: Paired many-to-many disjoint path covers of hypercubes with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763493)
