Bounds for the Super Extra Edge Connectivity of Graphs
From MaRDI portal
Publication:3196421
DOI10.1007/978-3-319-21398-9_49zbMath1468.05133OpenAlexW2293499126MaRDI QIDQ3196421
Chia-Wen Cheng, Sun-Yuan Hsieh
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_49
Related Items (2)
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
Cites Work
- Vulnerability of super edge-connected networks
- Edge fault tolerance of graphs with respect to super edge connectivity
- 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 computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- The \(k\)-restricted edge-connectivity of a product of 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‐λ′
This page was built for publication: Bounds for the Super Extra Edge Connectivity of Graphs
