Abstract
Let be a finite, connected graph. The average distance of a vertex of is the arithmetic mean of the distances from to all other vertices of . The remoteness and the proximity of are the maximum and the minimum of the average distances of the vertices of . In this paper, we present a sharp upper bound on the remoteness of a triangle-free graph of given order and minimum degree, and a corresponding bound on the proximity, which is sharp apart from an additive constant. We also present upper bounds on the remoteness and proximity of -free graphs of given order and minimum degree, and we demonstrate that these are close to being best possible.
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.