The generalized $k$-connectivity of a graph $G$, denoted by $κ_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The burnt pancake graph $BP_n$ and the godan graph $EA_n$ are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of $BP_n$ and $EA_n$. We show that $κ_3(BP_n)=n-1$ and $κ_3(EA_n)=n-1$.