On the minimum number of edges of two-connected graphs with given diameter (Q409426)
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 minimum number of edges of two-connected graphs with given diameter |
scientific article; zbMATH DE number 6023635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum number of edges of two-connected graphs with given diameter |
scientific article; zbMATH DE number 6023635 |
Statements
On the minimum number of edges of two-connected graphs with given diameter (English)
0 references
13 April 2012
0 references
2-connectedness
0 references
diameter
0 references
0.8418310284614563
0 references
0.800700306892395
0 references
0.7898547053337097
0 references
