The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph (Q811560)
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: The number of vertices of degree k in a minimally k-edge connected graph |
scientific article; zbMATH DE number 4216096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph |
scientific article; zbMATH DE number 4216096 |
Statements
The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph (English)
0 references
1992
0 references
minimally k-edge-connected simple graph
0 references
0.9583786725997924
0 references
0.9531401991844176
0 references
0.907310426235199
0 references
0.8788536190986633
0 references
