Abstract.
The eccentricity of a vertex v in a graph is the maximum of the distances from v to all other vertices. The diameter of a graph is the maximum of the eccentricities of its vertices. Fix the parameters n, d, c. Over all graphs with order n and diameter d, we determine the maximum (within 1) and the minimum of the number of vertices with eccentricity c.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Revised: May 7, 1999
Rights and permissions
About this article
Cite this article
Mubayi, D., West, D. On the Number of Vertices with Specified Eccentricity. Graphs Comb 16, 441–452 (2000). https://doi.org/10.1007/PL00007229
Issue Date:
DOI: https://doi.org/10.1007/PL00007229