The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs

DOI10.1007/978-3-319-12691-3_31zbMath1431.05090arXiv1401.2260OpenAlexW2096002650MaRDI QIDQ2942415

Yan Zhao, Jun Yue, Xue Liang Li

Publication date: 11 September 2015

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

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

zbMATH Keywords

edge-connectivitySteiner treeedge-disjoint pathsgeneralized edge-connectivityedge-disjoint Steiner trees

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs

This page was built for publication: The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs