Edge fault tolerance analysis of super k-restricted connected networks

An edge cut X of a connected graph G is a k  -restricted edge cut if G-XG-X is disconnected and every component of G-XG-X has at least k vertices. Additionally, if the deletion of a minimum k-restricted edge cut isolates a connected component of k vertices, then the graph is said to be super-  λkλk. In this paper, several sufficient conditions yielding super-λkλk graphs are given in terms of the girth and the diameter.