Proximity and remoteness in graphs: Results and conjectures

Mustapha Aouchiche, Pierre Hansen

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)

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). In this article we first prove upper and lower bounds on π and ρ as a function of the order n of G. A comparison between these two invariants follows and then each one is compared to the diameter, radius, average eccentricity, average distance, independence number and matching number. Most bounds so obtained are proved, but a few of them remain conjectures.

Original languageEnglish
Pages (from-to)95-102
Number of pages8
JournalNetworks
Volume58
Issue number2
DOIs
Publication statusPublished - Sep 2011
Externally publishedYes

Keywords

  • AutoGraphiX
  • distance
  • extremal graph
  • proximity
  • remoteness

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this