The average eccentricity of a graph and its subgraphs

Peter Dankelmann, Wayne Goddard, Christine S. Swart

Research output: Contribution to journalArticlepeer-review

99 Citations (Scopus)

Abstract

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity of a graph is the mean eccentricity of a vertex. In this paper we establish bounds on the mean eccentricity of a graph. We then examine the change in the average eccentricity when a graph is replaced by a spanning subgraph, in particular the two extreme cases: taking a spanning tree and removing one edge.

Original languageEnglish
Pages (from-to)41-51
Number of pages11
JournalUtilitas Mathematica
Volume65
Publication statusPublished - May 2004
Externally publishedYes

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The average eccentricity of a graph and its subgraphs'. Together they form a unique fingerprint.

Cite this