Title of article
The maximum radius of graphs with given order and minimum degree
Author/Authors
Kim، نويسنده , , Byeong Moon and Rho، نويسنده , , Yoomi and Song، نويسنده , , Byung Chul and Hwang، نويسنده , , Woonjae Hwang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
6
From page
207
To page
212
Abstract
Let G be a graph with order n and minimum degree δ ( ≥ 2 ) . Erdős et al. found an upper bound of the radius r of G , which is 3 2 n − 3 δ + 1 + 5 . They noted that this bound is tight apart from the exact value of the additive constant. In this paper, when r ≥ 3 , we decrease this bound to ⌊ 3 2 n δ + 1 ⌋ , the extremal value.
Keywords
minimum degree , order , Radius
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599794
Link To Document