1 paper · 1 filter
Yu Wang, Dan Li, Huiqiu Lin
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 gra…