On reliability of the folded hypercubes in terms of the extra edge-connectivity
From MaRDI portal
Publication:726366
DOI10.1016/J.INS.2014.02.081zbMath1362.68237OpenAlexW2027509617MaRDI QIDQ726366
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.081
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (15)
Strong Menger connectivity with conditional faults of folded hypercubes ⋮ Component connectivity of hypercubes ⋮ Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ On the 3-Extra Connectivity of Enhanced Hypercubes ⋮ Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Edge disjoint paths in hypercubes and folded hypercubes with conditional faults ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ The generalized 4-connectivity of hypercubes ⋮ Some results about the reliability of folded hypercubes ⋮ Strongly Menger connectedness of data center network and \((n,k)\)-star graph
Cites Work
- Unnamed Item
- Unnamed Item
- On reliability of the folded hypercubes
- Fault-free cycles in folded hypercubes with more faulty elements
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Extraconnectivity of hypercubes
- On the extraconnectivity of graphs
- Edge fault tolerance analysis of a class of interconnection networks
- Fault-tolerant analysis of a class of networks
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Linearly many faults in Cayley graphs generated by transposition trees
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- On conditional diagnosability of the folded hypercubes
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
- Conditional connectivity
- Diagnosability of enhanced hypercubes
- Constructing one-to-many disjoint paths in folded hypercubes
- Increasing the connectivity of the star graphs
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Some edge‐fault‐tolerant properties of the folded hypercube
This page was built for publication: On reliability of the folded hypercubes in terms of the extra edge-connectivity