Proximity and Remoteness in Graphs: a survey
Preprint
Abstract
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.
Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Proximity, remoteness and distance eigenvalues of a graphDiscrete Applied Mathematics, 2016
- Proximity, remoteness and minimum degreeDiscrete Applied Mathematics, 2015
- A survey of Nordhaus–Gaddum type relationsDiscrete Applied Mathematics, 2013
- Proximity and remoteness in graphs: Results and conjecturesNetworks, 2011
- Nordhaus–Gaddum relations for proximity and remoteness in graphsComputers & Mathematics with Applications, 2010
- Centrality measure in graphsJournal of Mathematical Chemistry, 2010
- Distance-Balanced GraphsAnnals of Combinatorics, 2008
- Variable Neighborhood Search for Extremal Graphs 14: The AutoGraphiX 2 System2006
- Introduction to Logistics Systems Planning and Control2003
- The average distance and the independence numberJournal of Graph Theory, 1988