Super restricted edge-connectivity of graphs with diameter 2

DOI10.1016/j.dam.2012.08.030zbMath1254.05089OpenAlexW2147250001MaRDI QIDQ1932468

Li Shang, Heping Zhang

Publication date: 18 January 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.030

zbMATH Keywords

diameterrestricted edge-connectivitysuper restricted edge-connected graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (6)

A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Reliability analysis of godan graphs

This page was built for publication: Super restricted edge-connectivity of graphs with diameter 2