Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
From MaRDI portal
Publication:2700790
DOI10.1016/j.tcs.2023.113855OpenAlexW4361228740WikidataQ121864480 ScholiaQ121864480MaRDI QIDQ2700790
Publication date: 27 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113855
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional connectivity of star graph networks under embedding restriction
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- On computing a conditional edge-connectivity of a graph
- On induced subgraphs of the cube
- Escaping a grid by edge-disjoint paths
- The super connectivity of folded crossed cubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- On the extraconnectivity of graphs
- Torus-like graphs and their paired many-to-many disjoint path covers
- Reliability measure of multiprocessor system based on enhanced hypercubes
- The extra connectivity of the enhanced hypercubes
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Edge-fault tolerance of hypercube-like networks
- Super connectivity of balanced hypercubes
- Edge-disjoint paths in faulty augmented cubes
- Efficient routing in all-optical networks
- Conditional connectivity
- Synthesis of reliable networks - a survey
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
- Optimal Assignments of Numbers to Vertices
This page was built for publication: Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
