On the Number of Vertices with Specified Eccentricity | Graphs and Combinatorics
Skip to main content

On the Number of Vertices with Specified Eccentricity

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Revised: May 7, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007229