The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks

DOI10.1016/J.TCS.2022.02.003MaRDI QIDQ2118871zbMATH OpenOpenAlexFDO

Authors Ruichao Niu, Min Xu

Publication date 23 March 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.02.003

zbMATH Keywords

bipartite hypercube-like networksfaulty elementsunpaired disjoint paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Paired many-to-many disjoint path covers in faulty hypercubes

Cites work

• Fault diagnosability of bicube networks under the PMC diagnostic model
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Hamiltonian properties on the class of hypercube-like networks
• Many-to-many disjoint paths in faulty hypercubes
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• The bicube: an interconnection of two hypercubes
• The bipanconnectivity of bipartite hypercube-like networks
• The Mobius cubes
• Two node-disjoint paths in balanced hypercubes
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

Cited in

(7)

• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
• One-to-one disjoint-path covers of leaf-sort graphs
• Paired 2-disjoint path cover of burnt pancake graphs with n - 3 faulty elements
• Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
• Characterizing k-edge Hamiltonian connectedness for enhancing network structures

This page was built for publication: The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

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