Abstract
Let be a finite, connected graph. The eccentricity of a vertex of is the distance from to a vertex farthest from . The average eccentricity of is the arithmetic mean of the eccentricities of the vertices of . We show that the average eccentricity of a connected graph of girth at least six is at most , where is the order of and its minimum degree. We construct graphs that show that whenever is a prime power, then this bound is sharp apart from an additive constant. For graphs containing a vertex of large degree we give an improved bound. We further show that if the girth condition on is relaxed to having neither a -cycle nor a -cycle as a subgraph, then similar and only slightly weaker bounds hold.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.