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 language | English |
|---|---|
| Pages (from-to) | 41-51 |
| Number of pages | 11 |
| Journal | Utilitas Mathematica |
| Volume | 65 |
| Publication status | Published - May 2004 |
| Externally published | Yes |
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics