Super edge connectivity properties of connected edge symmetric graphs

Abstract

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity λ′(G). We evaluate λ′(G) and the number of i-cutsets Ci(G), d ≤ i ≤ 2d − 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same subject. © 1999 John Wiley & Sons, Inc. Networks 33: 157–159, 1999