Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
The maximum radius of graphs with given order and minimum degree
- Issue Date
- 28-1월-2012
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Radius; Minimum degree; Order
- Citation
- DISCRETE MATHEMATICS, v.312, no.2, pp.207 - 212
- Indexed
- SCIE
SCOPUS
- Journal Title
- DISCRETE MATHEMATICS
- Volume
- 312
- Number
- 2
- Start Page
- 207
- End Page
- 212
- ISSN
- 0012-365X
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Hwang, Woon Jae
- 과학기술대학 (응용수리과학부 데이터계산과학전공)