The connectivity of generalized graph products

Bermond et al. (1984) [2] introduced a generalized product of graphs to model and construct large reliable networks under optimal conditions. This model includes the generalized prisms (also known as the permutation graphs). Piazza and Ringeisen (1991) [13] studied the optimal connectivity of generalized prisms and Lai (1995) [8] investigated the maximum subgraph connectivity of the generalized prisms. Li et al. extended these results to generalized products of trees. In this paper, we investigate the maximum subgraph connectivity of generalized product of graphs, which extends the previous results mentioned above, and obtain sufficient conditions to warrant the construction of large survivable networks via generalized products. Sharpness of our results are addressed.