Fault-tolerant analysis of a class of networks
From MaRDI portal
Publication:2379976
DOI10.1016/j.ipl.2007.04.005zbMath1187.68087OpenAlexW2136313212MaRDI QIDQ2379976
Min Xu, Qiang Zhu, Jun-Ming Xu
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.005
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (11)
On \(g\)-extra connectivity of hypercube-like networks ⋮ On the reliability of generalized Petersen graphs ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ Optimal broadcasting for locally twisted cubes ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ \(\{2,3\}\)-restricted connectivity of locally twisted cubes ⋮ Extraconnectivity of \(k\)-ary \(n\)-cube networks ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ On reliability of the folded hypercubes in terms of the extra edge-connectivity ⋮ Structure connectivity and substructure connectivity of twisted hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Super connectivity of line graphs
- On computing a conditional edge-connectivity of a graph
- A survey of the theory of hypercube graphs
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Optimally super-edge-connected transitive graphs
- Edge fault tolerance analysis of a class of interconnection networks
- Note on the connectivity of line graphs
- Super connectivity of line graphs and digraphs
- On optimally-\(\lambda^{(3)}\) transitive graphs
- On restricted arc-connectivity of regular digraphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Conditional connectivity
- The Mobius cubes
- Theory and Application of Graphs
- The locally twisted cubes
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- The twisted N-cube with application to multiprocessing
- On restricted edge-connectivity of graphs.
This page was built for publication: Fault-tolerant analysis of a class of networks
