Super restricted edge connectivity of regular graphs with two orbits

It is well known that the edge-connectivity of a simple, connected, vertex transitive graph attains its regular degree. It is then natural to consider the relationship between the graph’s edge connectivity and the number of orbits of its automorphism group. In 6], Liu and Meng (2008) studied the edge connectivity of regular double-orbits graphs. Later, Lin et al. (in press) 10] characterized the λ′-optimal 3-regular double-orbit graph and given a sufficient condition for the k-regular double-orbit graphs to be optimal. In this note, we characterize the super restricted edge connected k-regular double-orbit graphs with grith at least 6.