The smallest number of edges in a 2-connected graph with specified diameter (Q2384419)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The smallest number of edges in a 2-connected graph with specified diameter |
scientific article |
Statements
The smallest number of edges in a 2-connected graph with specified diameter (English)
0 references
21 September 2007
0 references
diameter
0 references
2-connected graph
0 references
minimum size
0 references
minimum number of edges
0 references
charging method
0 references
discharging method
0 references
