Lower bounds on the vertex-connectivity of digraphs and graphs (Q845669)
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: Lower bounds on the vertex-connectivity of digraphs and graphs |
scientific article; zbMATH DE number 5664455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the vertex-connectivity of digraphs and graphs |
scientific article; zbMATH DE number 5664455 |
Statements
Lower bounds on the vertex-connectivity of digraphs and graphs (English)
0 references
29 January 2010
0 references
fault tolerance
0 references
connectivity
0 references
minimum degree
0 references
maximum degree
0 references
degree sequence
0 references
0.96231055
0 references
0.92367584
0 references
0.91449046
0 references
0.91210026
0 references
0.90502673
0 references
