Title of article
Diameter and inverse degree Original Research Article
Author/Authors
Peter Dankelmann، نويسنده , , Henda C. Swart، نويسنده , , Paul van den Berg، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
4
From page
670
To page
673
Abstract
The inverse degree image of a finite graph image is defined as image. We prove that, if G is connected and of order n, then the diameter of G is less than image. This improves a bound given by Erdös et al. by a factor of approximately 2.
Keywords
Distance , Diameter , Inverse degree
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947449
Link To Document