Title of article
The smallest number of edges in a 2-connected graph with specified diameter Original Research Article
Author/Authors
D. Belotserkovsky، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
9
From page
2376
To page
2384
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 image.
Keywords
Charging method , Discharging method , 2-Connected graph , Minimum number of edges , Diameter , Minimum size
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947829
Link To Document