Semi-hyper-connected vertex transitive graphs

A graph GG is said to be semi-hyper-connected if the removal of every minimum cut of GG creates exactly two connected components. In this paper, we characterize semi-hyper-connected vertex transitive graphs, in particular Cayley graphs.