Sufficient conditions for graphs to be λ′‐optimal and super‐λ′

DOI10.1002/NET.20173zbMath1116.05045OpenAlexW2315005121MaRDI QIDQ3442866

Li Shang, Heping Zhang

Publication date: 23 May 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20173

zbMATH Keywords

restricted edge-connectivityoptimally restricted edge-connectedrestricted edge-cutsuper restricted edge-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (15)

Bounds for the Super Extra Edge Connectivity of Graphs ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ Super-connected but not super edge-connected graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ Codes from incidence matrices of graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Vulnerability of super extra edge-connected graphs ⋮ Super restricted edge connected Cartesian product graphs ⋮ The restricted arc connectivity of Cartesian product digraphs ⋮ On super edge-connectivity of product graphs ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected

Cites Work

• Unnamed Item

This page was built for publication: Sufficient conditions for graphs to be λ′‐optimal and super‐λ′