Generalized eccentricity, radius, and diameter in graphs

Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


For a vertex v and a (k - 1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P. Associated with each of these distances, one can define the k-eccentricity of the vertex v as the maximum distance over all P and the k-eccentricity of the set P as the maximum distance over all v. If k = 2, one is back with the normal eccentricity. We study here the properties of these eccentricity measures, especially bounds on the associated radius (minimum k-eccentricity) and diameter (maximum k-eccentricity).

Original languageEnglish
Pages (from-to)312-319
Number of pages8
Issue number4
Publication statusPublished - Dec 1999
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Generalized eccentricity, radius, and diameter in graphs'. Together they form a unique fingerprint.

Cite this