Sufficient conditions for k-restricted edge connected graphs
From MaRDI portal
Publication:300253
DOI10.1016/J.TCS.2014.08.018zbMATH Open1338.68224OpenAlexW1974074452MaRDI QIDQ300253FDOQ300253
Authors: Lei Zhang, Shiying Wang 
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
Recommendations
- Sufficient conditions for maximally restricted edge connected graphs
- Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
- Sufficient degree conditions for \(k\)-edge-connectedness of a graph
- Some sufficient conditions on \(k\)-connected graphs
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Sufficient conditions for graphs to be maximally 3-restricted edge connected
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Two sufficient conditions for maximally restricted-edge-connected hypergraphs
Cites Work
- Graph theory
- Extraconnectivity of graphs with large girth
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- On unreliability polynomials and graph connectivity in reliable network synthesis
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Optimally super-edge-connected transitive graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- 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
- 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
- Sufficient conditions for a graph to be super restricted edge-connected
- Optimally restricted edge connected elementary Harary graphs
- 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
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On the restricted connectivity and superconnectivity in graphs with given girth
Cited In (30)
- Local restricted edge connectivity and restricted edge connectivity of graphs.
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Restricted edge connectivity of Harary graphs
- \(k\)-restricted edge-connectivity in triangle-free graphs
- On a kind of reliability analysis of networks
- Sufficient conditions for restricted-edge-connectivity to be optimal
- \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
- Optimally restricted edge connected elementary Harary graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- The \(k\)-restricted edge connectivity of balanced bipartite graphs
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Title not available (Why is that?)
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
- 2-restricted edge connectivity of wheel networks
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- A necessary and sufficient condition for a graph to be edge tenacious
- On equality of restricted edge connectivity and minimum edge degree of graphs.
- Neighborhood conditions for graphs to be super restricted edge connected
- An extended study of k-restricted edge connectivity: Another approach to Tait’s coloring theorem
- A sufficient condition for graphs to be \(\lambda_k\)-optimal
This page was built for publication: Sufficient conditions for \(k\)-restricted edge connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300253)
