The maximum radius of graphs with given order and minimum degree

초록

Let G be a graph with order n and minimum degree delta(>= 2). Erdos et al. found an upper bound of the radius r of G, which is 3/2 n-3/delta+1 + 5. They noted that this hound is tight apart from the exact value of the additive constant. In this paper, when r >= 3, we decrease this bound to left perpendicular3/2 n/delta+1right perpendicular, the extremal value. (C) 2011 Elsevier B.V. All rights reserved.

키워드