Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
From MaRDI portal
Publication:6114850
DOI10.1142/s0129054121500301zbMath1520.68124arXiv1912.05443OpenAlexW3202701024MaRDI QIDQ6114850
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.05443
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
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 ⋮ Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Two node-disjoint paths in balanced hypercubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Bipanconnectivity of balanced hypercubes
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Hamiltonian laceability in hypercubes with faulty edges
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Linear array and ring embeddings in conditional faulty hypercubes
- Parallel edge-region-based segmentation algorithm targeted at reconfigurable MultiRing network
- Matching preclusion for balanced hypercubes
- Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Super connectivity of balanced hypercubes
- Symmetric Property and Reliability of Balanced Hypercube
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
- On extra connectivity and extra edge-connectivity of balanced hypercubes