In 2009, L. Barrière et al. [L. Barrière et al., The hierarchical product of graphs, Discrete Appl. Math. 157 (2009), 36-48] introduce two new graph operations, called the hierarchical product and the generalized hierarchical product. Let V(G) = {x1, x2, … , xn}, V(H) = {y1, y2, … , yn} and U be a subset of V(G). In this paper, we obtain the connectivity of generalized hierarchical product of two graphs G and G on U, denoted by H ⊓ G(U). The vertex set of V(H ⊓ G(U)) is V(G) × V(H), and for which (xi, yp) (xj, yq) is an edge if xi = xj ∈ U and ypyq ∈ E(H), or xixj ∈ E(H) and yp = yq. By the definition we know the Cartesian product is a special case of the generalized hierarchical product when U = V(G). Let G□H be the Cartesian product of G and H, by our result we can also obtain that κ(G□H) = min{κ(G)|V(H)|, κ(H)|V(H)|, δ(G) + δ(H)} which is a main result in [1].