Super edge-connectivity of mixed Cayley graph

A graph XX is max-λλ if λ(X)=δ(X)λ(X)=δ(X). A graph XX is super-λλ if XX is max-λλ and every minimum edge-cut set of XX isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-λλ and super-λλ.