论文部分内容阅读
Let h be a nonnegative integer. The h-restricted edge connectivity λh(G) of a simple connected graph G is defined as the minimum cardinality over the sets of edges of G, if any, whose removal disconnects G and every component of the resulting graph has m