Sufficient conditions for \(k\)-restricted edge connected graphs
From MaRDI portal
Publication:300253
DOI10.1016/j.tcs.2014.08.018zbMath1338.68224OpenAlexW1974074452MaRDI QIDQ300253
Publication date: 27 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.018
Related Items
A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Unnamed Item
Cites Work
- Unnamed Item
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Optimally restricted edge connected elementary Harary graphs
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On the restricted connectivity and superconnectivity in graphs with given girth
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- On the construction of most reliable networks
- 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
- Super restricted edge-connectivity of graphs with diameter 2
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Neighborhood conditions for graphs to be super restricted edge connected
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Sufficient conditions for a graph to be super restricted edge-connected
- On restricted connectivities of permutation graphs
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Sufficient conditions for λ′‐optimality in graphs with girth g
