The proximity $\pi = \pi (G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $\rho = \rho (G)$. The concepts of proximity and remoteness, first defined in 2006, attracted the attention of several researchers in Graph Theory. Their investigation led to a considerable number of publications. In this paper, we present a survey of the research work.
Comment: arXiv admin note: substantial text overlap with arXiv:1204.1184 by other authors, updated version, to appear in Discrete Applied Mathematics