Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
From MaRDI portal
Publication:906386
DOI10.1016/j.tcs.2015.11.049zbMath1334.68032OpenAlexW2255758806MaRDI QIDQ906386
Xing Feng, Mingzu Zhang, Lian Zhu Zhang
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.049
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (10)
Edge-disjoint paths in faulty augmented cubes ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ On the 3-Extra Connectivity of Enhanced Hypercubes ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Connectivity and super connectivity of folded hypercube-like networks ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- On \(g\)-extra connectivity of folded hypercubes
- Linear wirelength of folded hypercubes
- On reliability of the folded hypercubes in terms of the extra edge-connectivity
- On reliability of the folded hypercubes
- K-restricted edge connectivity for some interconnection networks
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- On the extraconnectivity of graphs
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Cycles in folded hypercubes
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
- Conditional connectivity
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
This page was built for publication: Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes