Let G be a finite, connected graph. The average distance of a vertex v of G is the arithmetic mean of the distances from v to all other vertices of G. The remoteness $\rho (G)$ and the proximity $\pi (G)$ of G are the maximum and the minimum of the average distances of the vertices of G. 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 $C_4$-free graphs of given order and minimum degree, and we demonstrate that these are close to being best possible.

设G是一个有限的连通图。一个顶点的平均距离v的ģ距离的距离的算术平均值v到的所有其他顶点ģ。偏远$\rho (G)$ 和接近 $\pi (G)$的ģ是最大值和最小值的顶点的平均距离的ģ。在本文中，我们提出了给定阶次和最小度数的无三角形图的远程度的尖锐上限，以及邻近度的相应界限，除了加性常数之外，该上界是尖锐的。我们还给出了远程和接近的上限$C_4$给定顺序和最小程度的自由图，我们证明这些接近于最好的。