Vulnerability of super extra edge-connected graphs
From MaRDI portal
Publication:2009643
DOI10.1016/j.jcss.2019.07.002zbMath1436.68225OpenAlexW2965011693MaRDI QIDQ2009643
Sun-Yuan Hsieh, Ralf Klasing, Chia-Wen Cheng
Publication date: 29 November 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2019.07.002
fault toleranceedge-connectivityextra edge-connectivitypersistence of networkssuper extra edge-connectivity
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (3)
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Reliability measure of multiprocessor system based on enhanced hypercubes ⋮ Fault diagnosability of bicube networks under the PMC diagnostic model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Vulnerability of super edge-connected networks
- Edge fault tolerance of graphs with respect to super edge connectivity
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Large graphs with given degree and diameter. II
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
- On super edge-connectivity of product graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- On cyclic edge-connectivity of transitive graphs
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- On conditional edge-connectivity of graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- Connectivity of vertex and edge transitive graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- On the extraconnectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- On restricted edge-connectivity of lexicographic product graphs
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Conditional connectivity
- Super Line-Connectivity Properties of Circulant Graphs
This page was built for publication: Vulnerability of super extra edge-connected graphs
