2 citations · 2 across the 20 of their papers we have counts for
1 paper · 2 filters
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…