The generalized 3-connectivity of Lexicographic product graphs

Xueliang Li (1) , Yaping Mao (2)

1 CFC - 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.

Mots clés: Graph Theory; Discrete Mathematics; Theoretical Computer Science

Domaines: Mathématique discrète [cs.DM]

Xueliang Li, Yaping Mao. The generalized 3-connectivity of Lexicographic product graphs. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.339--353. ⟨10.46298/dmtcs.1266⟩. ⟨hal-01179222⟩