文献类型：期刊文献

英文题名：Minimally (k,k)-edge-connected graphs via spectral radius

作者：Wang, Yu[1]; Li, Dan[1]; Lin, Huiqiu[1,2]

机构：[1] College of Mathematics and System Science, Xinjiang University, Urumqi, 830017, China; [2] Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China

年份：2026

外文期刊名：arXiv

收录：EI(收录号：20260308818)

语种：英文

外文关键词：Eigenvalues and eigenfunctions - Graph embeddings - Undirected graphs

摘要：For l > 1, the l-edge-connectivity κ′l(G) of a connected graph G is defined as the minimum number of edges whose removal leaves a graph with at least l components. A graph is minimally (k, l)-edge-connected if κ′l(G) ≥ k but for any edge e ∈ E(G) satisfies that κ′l(G?e) ? 2026, CC BY.