1. The difference between remoteness and radius of a graph.
- Author
-
Hua, Hongbo, Chen, Yaojun, and Das, Kinkar Ch.
- Subjects
- *
RADIUS (Geometry) , *GRAPH theory , *GRAPH connectivity , *GEOMETRIC vertices , *MATHEMATICAL bounds - Abstract
Let G be a connected graph of order n ≥ 3 . The remoteness ρ = ρ ( G ) is the maximum, over all vertices, of the average distance from a vertex to all others. The radius r = r ( G ) is the minimum, over all vertices, of the eccentricity of a vertex. Aouchiche and Hansen (2011) conjectured that ρ − r ≥ 3 − n 4 if n is odd and ρ − r ≥ 2 n − n 2 4 ( n − 1 ) if n is even. In this paper, we confirm this conjecture. In addition, we completely characterize extremal graphs attaining the lower bound. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF