Super edge-connectivity of mixed Cayley graph

A graph X is max- λ if λ ( X ) = δ ( X ) . A graph X is super- λ if X is max- λ and every minimum edge-cut set of X 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- λ .