\(i\)-Connectivity in a Generalized Hypercube

Inclusive connectivity parameters for a given vertex in a graph \(G\) are measures of how close that vertex is to being a cutvertex. Thus they provide a local measure of graph vulnerability. In this paper we provide bounds on the inclusive connectivity parameters in \(K_2 \times G\) and inductively extend the results to a certain generalized hypercube.