The generalized 3-edge-connectivity of lexicographic product graphs

2014/01/10 by Xueliang Li, Jun Yue, Li, Xueliang +3
Mathematics · #05C05 #05C40 #05C70 #05C76 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C05 #msc:05C40 #msc:05C70 #msc:05C76

paper · pdf · doi:10.48550/arxiv.1401.2260

14 pages

arxiv created 2014/01/10 · arxiv updated 2014/01/13

Abstract

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 λ₃(G ∘ H). Moreover, all bounds are sharp.

Related

• The generalized 3-connectivity of Lexicographic product graphs
• Two bounds for generalized 3-connectivity of Cartesian product graphs
• On the generalized (edge-)connectivity of graphs
• The generalized 3-(edge) connectivity of total graphs
• A survey on the generalized connectivity of graphs