论文部分内容阅读
Given a graph G and a non-negative integer h, the h-restricted connectivity κh (G) of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whose deletion disconnects G and every remai