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-X is disconnected and every component of G-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. In this paper, several sufficient conditions yielding super-λk graphs are given in terms of the girth and the diameter.