Component connectivity of the data center network dcell
From MaRDI portal
Recommendations
Cites work
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Component connectivity of generalized Petersen graphs
- Component connectivity of hypercubes
- Component connectivity of the hypercubes
- Conditional connectivity of folded hypercubes
- Graph theory
- scientific article; zbMATH DE number 4023324 (Why is no real title available?)
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- Strongly Menger-edge-connectedness of DCell networks
- Structural properties of generalized exchanged hypercubes
- Super edge-connectivity and matching preclusion of data center networks
- The 4-component connectivity of alternating group networks
- The \(k\)-restricted edge-connectivity of the data center network DCell
- The component (edge) connectivity of shuffle-cubes
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- The restricted h-connectivity of the data center network DCell
Cited in
(10)- The \(k\)-restricted edge-connectivity of the data center network DCell
- The restricted h-connectivity of the data center network DCell
- Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern
- Structure connectivity of data center networks
- Two-disjoint-cycle-cover pancyclicity of data center networks
- l-connectivity, l-edge-connectivity and spectral radius of graphs
- Cyclic connectivity and cyclic diagnosability of data center network DCell
- Exponentiation of graphs
- Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity
- Two-round probabilistic diagnosis algorithm for fault identification
This page was built for publication: Component connectivity of the data center network dcell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698084)