The generalized 3-edge-connectivity of lexicographic product graphs

DOI10.1007/978-3-319-12691-3_31zbMATH Open1431.05090arXiv1401.2260OpenAlexW2096002650MaRDI QIDQ2942415FDOQ2942415

Authors: Jun Yue, Yan Zhao, Xueliang Li 

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Abstract: The generalized $k$-edge-connectivity $lambd{a}_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 $GcircH$, is an important graph product. In this paper, we mainly study the generalized 3-edge-connectivity of $GcircH$, and get upper and lower bounds of $lambd{a}_3(GcircH)$. Moreover, all bounds are sharp.

Full work available at URL: https://arxiv.org/abs/1401.2260

Recommendations

• The generalized 3-connectivity of lexicographic product graphs
• The generalized 3-connectivity of graph products
• Sharp upper bounds for generalized edge-connectivity of product graphs
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• Generalized 3-edge-connectivity of Cartesian product graphs.

zbMATH Keywords

edge-disjoint pathsSteiner treeedge-connectivitygeneralized edge-connectivityedge-disjoint Steiner trees

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (8)

• On the Euler property of the lexicographic product of graphs
• Path-connectivity of lexicographic product graphs
• On restricted edge-connectivity of lexicographic product graphs
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• Path 3-(edge-)connectivity of lexicographic product graphs
• Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
• The generalized 3-connectivity of lexicographic product graphs

This page was built for publication: The generalized 3-edge-connectivity of lexicographic product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942415)