Super restricted edge-connectivity of vertex-transitive graphs

We prove that a connected vertex-transitive graph G with degree image and girth image is super restricted edge-connected, that is, if F is a set of image edges of G such that image is disconnected and every component of image has at least two vertices, then F is the set of edges adjacent to a certain edge in G. We also show that neither the condition image nor image can be weakened.