Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using a progressive withdrawal procedure to study superconnectivity in digraphs |
scientific article; zbMATH DE number 1934678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using a progressive withdrawal procedure to study superconnectivity in digraphs |
scientific article; zbMATH DE number 1934678 |
Statements
Using a progressive withdrawal procedure to study superconnectivity in digraphs (English)
0 references
25 June 2003
0 references
Parameters \(k\) and \(\lambda\) are used to measure the connectivity and edge-connectivity, and parameters \(k_1\) and \(\lambda_1\) to measure the superconnectivity and edge-superconnectivity. The authors give a sufficient condition for the superconnectivity of a graph in terms of the diameter of the graph, and they also give a lower bound for the superconnectivity \(k_1\). An analogical sufficient condition and a lower bound are given for the edge-superconnectivity \(\lambda_1\).
0 references
connectivity
0 references
superconnectivity
0 references
cut-set
0 references
digraph
0 references
