2000 character limit reached
The generalized 3-edge-connectivity of lexicographic product graphs
Published 10 Jan 2014 in math.CO | (1401.2260v1)
Abstract: The generalized $k$-edge-connectivity $\lambda_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\circ H$, is an important graph product. In this paper, we mainly study the generalized 3-edge-connectivity of $G \circ H$, and get upper and lower bounds of $\lambda_3(G \circ H)$. Moreover, all bounds are sharp.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.