On the maximum and minimum sizes of a graph with given \(k\)-connectivity (Q2364084)
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 maximum and minimum sizes of a graph with given k-connectivity |
scientific article; zbMATH DE number 6747772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum and minimum sizes of a graph with given \(k\)-connectivity |
scientific article; zbMATH DE number 6747772 |
Statements
On the maximum and minimum sizes of a graph with given \(k\)-connectivity (English)
0 references
17 July 2017
0 references
\(k\)-connectivity
0 references
generalized connectivity
0 references
connectivity
0 references
0 references
0 references
0.8529260158538818
0 references
0.837443470954895
0 references
0.8345088362693787
0 references
0.8309902548789978
0 references
0.8239912390708923
0 references
