A sufficient condition for graphs to be super \(k\)-restricted edge connected
From MaRDI portal
Publication:2364076
DOI10.7151/dmgt.1939zbMath1366.05063OpenAlexW2560206910MaRDI QIDQ2364076
Lei Zhang, Meiyu Wang, Shi-ying 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
Related Items
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ Unnamed Item ⋮ Reliability analysis of godan graphs
Cites Work
- Unnamed Item
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Optimally restricted edge connected elementary Harary graphs
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- 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
- Neighborhood conditions for graphs to be super restricted edge connected
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Sufficient conditions for λ′‐optimality in graphs with girth g
