On computing a conditional edge-connectivity of a graph (Q1095928): Difference between revisions

The conditional edge-connectivity \(\lambda\) (G:P) of a graph G(V,E) has been defined by Harary as the minimum cardinality \(| S|\) of a set S of edges such that G-S is disconnected and every component of G-S has the given graph property P. In this article we present lower and upper bounds for \(\lambda\) (G:P) when P is defined as follows: A graph H satisfies property P if it contains more than one vertex. We then present a polynomial-time algorithm for the computation of \(\lambda\) (G:P). A new generalization of the notion of connectivity is also given.