Average distance and independence number

Research output: Contribution to journalArticlepeer-review

73 Citations (Scopus)


A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.

Original languageEnglish
Pages (from-to)75-83
Number of pages9
JournalDiscrete Applied Mathematics
Issue number1-2
Publication statusPublished - 22 Jun 1994
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Average distance and independence number'. Together they form a unique fingerprint.

Cite this