On computing a conditional edge-connectivity of a graph (Q1095928): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:25, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On computing a conditional edge-connectivity of a graph |
scientific article |
Statements
On computing a conditional edge-connectivity of a graph (English)
0 references
1988
0 references
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.
0 references
conditional edge-connectivity
0 references