Edge connectivity of subset of vertices and construction of optimal graded edge connected graph
Wu Hai · Journal of Central China Normal University · 2002
G=(V,E) is a connected graph, no loop but allow the existence of multi edges. S is a subset of V at least including two vertices. The edge connectivity of S denoted by λ c(S) is defined to the largest number of edges whose removal disconnectes G . In this paper, the concept of edge connectivity of subset of vertices is given. On this basis, the problem of constrution of optimal graded edge connected graph is presented. The construction method is presented also.