Super s-restricted edge-connectivity of vertex-transitive graphs

Let G be a connected graph with vertex-set V (G) and edge-set E(G). A subset F of E(G) is an s-restricted edge-cut of G if G - F is disconnected and every component of G - F has at least s vertices. Let λ _s (G) be the minimum size of all s-restricted edge-cuts of G and ξ _s (G)=min{|X, V (G)\X]|: |X| = s, GX] is connected}, where X, V (G)\X] is the set of edges with exactly one end in X. A graph G with an s-restricted edge-cut is called super s-restricted edge-connected, in short super-λ _s , if λ _s (G) = ξ _s (G) and every minimum s-restricted edge-cut of G isolates one component GX] with |X| = s. It is proved in this paper that a connected vertex-transitive graph G with degree k > 5 and girth g > 5 is super-λ _s for any positive integer s with s ? 2g or s ? 10 if k = g = 6.