| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651039 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
It is proved that, if n is sufficiently large compared with d, then the smallest number of edges in a 2-connected graph with n vertices and diameter at most d is exactly ⌈(dn-2d-1)/(d-1)⌉⌈(dn-2d-1)/(d-1)⌉.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
D. Belotserkovsky,