On the lower bound of \(k\)-maximal digraphs (Q294549)
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: On the lower bound of k-maximal digraphs |
scientific article; zbMATH DE number 6593969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the lower bound of \(k\)-maximal digraphs |
scientific article; zbMATH DE number 6593969 |
Statements
On the lower bound of \(k\)-maximal digraphs (English)
0 references
16 June 2016
0 references
strong arc connectivity
0 references
maximum subdigraph arc connectivity
0 references
extremal digraphs
0 references
0 references
0.90938926
0 references
0.90868104
0 references
0.9084798
0 references
0.8974241
0 references
0.89667565
0 references
0.8958267
0 references
0.89272213
0 references
