The generalized k-edge-connectivity λk(G) of a graph G is a
generalization of the concept of edge-connectivity. The lexicographic product
of two graphs G and H, denoted by G∘H, is an important graph
product. In this paper, we mainly study the generalized 3-edge-connectivity of
G∘H, and get upper and lower bounds of λ3(G∘H).
Moreover, all bounds are sharp.Comment: 14 page