Proximity and remoteness in graphs: A survey

Mustapha Aouchiche, Bilal Ahmad Rather

Research output: Contribution to journalArticlepeer-review

Abstract

The proximity π=π(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 ρ=ρ(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 done to date.

Original languageEnglish
Pages (from-to)94-120
Number of pages27
JournalDiscrete Applied Mathematics
Volume353
DOIs
Publication statusPublished - Aug 15 2024

Keywords

  • Distance
  • Extremal graphs
  • Proximity
  • Remoteness
  • Transmission

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Proximity and remoteness in graphs: A survey'. Together they form a unique fingerprint.

Cite this