Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity
From MaRDI portal
Publication:6068192
DOI10.1016/j.amc.2023.128343OpenAlexW4387083820MaRDI QIDQ6068192
Mingzu Zhang, Ji Xiang Meng, Yayu Yang
Publication date: 13 November 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.128343
hypercubeinterconnection networksfolded hypercubeBC network\(h\)-extra \(r\)-component edge-connectivitylink fault tolerance
Computer system organization (68Mxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- On the \(t/k\)-diagnosability of BC networks
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- The spanning connectivity of folded hypercubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- On the extraconnectivity of graphs
- The spined cube: a new hypercube variant with smaller diameter
- Component edge connectivity of hypercube-like networks
- Conditional edge connectivity of the locally twisted cubes
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- On conditional diagnosability of the folded hypercubes
- \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes
- Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity
- Conditional connectivity
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- The Mobius cubes
- Component Edge Connectivity of Hypercubes
- Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
- An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
This page was built for publication: Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity