The generalized 3-edge-connectivity of lexicographic product graphs
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 λ3(G H). Moreover, all bounds are sharp.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.