Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity
From MaRDI portal
Publication:2672572
DOI10.1016/j.tcs.2022.04.010OpenAlexW4223928661MaRDI QIDQ2672572
Zhaoxia Tian, Mingzu Zhang, Xing Feng
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.010
Cartesian productconcentration phenomenon\(\lambda_h\)-optimality\(h\)-extra edge-connectivityparallel and distributed systemreliability and fault tolerance
Related Items (2)
Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges
Cites Work
- Unnamed Item
- Global defensive alliances of trees and Cartesian product of paths and cycles
- Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- On reliability of the folded hypercubes in terms of the extra edge-connectivity
- On the extra edge-connectivity of hypercubes
- On reliability of the folded hypercubes
- On computing a conditional edge-connectivity of a graph
- On the extraconnectivity of graphs
- Edge fault tolerance analysis of a class of interconnection networks
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Conditional connectivity
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- On extra connectivity and extra edge-connectivity of balanced hypercubes
This page was built for publication: Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity