A sufficient condition for graphs to be super k-restricted edge connected
From MaRDI portal
Publication:2364076
DOI10.7151/DMGT.1939zbMATH Open1366.05063OpenAlexW2560206910MaRDI QIDQ2364076FDOQ2364076
Authors: Meiyu Wang, Lei Zhang, Shiying Wang 
Publication date: 17 July 2017
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1939
Recommendations
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Super restricted edge connectivity of regular graphs
- Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
Cites Work
- Graph theory
- Extraconnectivity of graphs with large girth
- On computing a conditional edge-connectivity of a graph
- 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
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Super restricted edge-connectivity of graphs with diameter 2
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- Optimally restricted edge connected elementary Harary 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
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
Cited In (15)
- The edge connectivity of expanded \(k\)-ary \(n\)-cubes
- Sufficient conditions for bipartite graphs to be super restricted edge-connected
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Sufficient conditions for \(k\)-restricted edge connected graphs
- On super connectedness and super restricted edge-connectedness of total 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
- Super restricted edge connectivity of regular graphs
- Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Reliability analysis of godan graphs
- Title not available (Why is that?)
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- Neighborhood conditions for graphs to be super restricted edge connected
This page was built for publication: A sufficient condition for graphs to be super \(k\)-restricted edge connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364076)
