Unpaired many-to-many disjoint path covers on bipartite k-ary n-cube networks with faulty elements
From MaRDI portal
Publication:4983546
Recommendations
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Many-to-many disjoint path covers in k-ary n-cubes
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Cites work
- An efficient algorithm to construct disjoint path covers of DCell networks
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Disjoint-paths and fault-tolerant routing on recursive dual-net
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- Many-to-many disjoint path covers in k-ary n-cubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- Paired many-to-many disjoint path covers in faulty hypercubes
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants (G(2ᵐ,4))
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
- The super spanning connectivity and super spanning laceability of tori with faulty elements
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Cited in
(18)- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
- Hyper star fault tolerance of bubble sort networks
- Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
- Many-to-many disjoint path covers in k-ary n-cubes
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
- Set-to-set disjoint paths in a folded hypercube
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- 2-edge-Hamilton-connectedness of complete hypercube-like networks
- k-edge-Hamilton-laceable bipartite graphs
- Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
- Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\)
- Disjoint path covers of star graphs
- One-to-one disjoint path covers in digraphs with faulty edges
- Degree conditions for disjoint path covers in digraphs
- On sufficient degree conditions for a graph to be disjoint path coverable
- Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
This page was built for publication: Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983546)
