Upper bounds on the average eccentricity
Sharp upper bounds on the average eccentricity of a connected graph of given order in terms of its independence number, chromatic number, domination number or connected domination number are given. Our results settle two conjectures of the computer program AutoGraphiX (Aouchicheetal., 2005).
average eccentricity independence number chromatic number domination number connected domination number