The generalized 3-connectivity of Lexicographic product graphsArticle
Authors: Xueliang Li 1; Yaping Mao 2
NULL##0000-0001-9134-237X
Xueliang Li;Yaping Mao
1 Center for Combinatorics [Nankai]
2 Department of Mathematics [Qianghai]
The generalized k-connectivity κk(G) of a graph G, first introduced by Hager, is a natural generalization of the concept of (vertex-)connectivity. Denote by G^H and G&Box;H the lexicographic product and Cartesian product of two graphs G and H, respectively. In this paper, we prove that for any two connected graphs G and H, κ3(G^H)≥ κ3(G)|V(H)|. We also give upper bounds for κ3(G&Box; H) and κ3(G^H). Moreover, all the bounds are sharp.