Average distance in bipartite tournaments

P. Dankelmann, L. Volkmann

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


The average distance μ(D) of a strong digraph D is the average of the distances between all ordered pairs of distinct vertices of D. Plesník [3] proved that if D is a strong tournament of order n, then μ(D) ≤ n+4/6 + 1/n. In this paper we show that, asymptotically, the same inequality holds for strong bipartite tournaments. We also give an improved upper bound on the average distance of a k-connected bipartite tournament.

Original languageEnglish
Pages (from-to)295-306
Number of pages12
JournalArs Combinatoria
Publication statusPublished - Apr 2007
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Average distance in bipartite tournaments'. Together they form a unique fingerprint.

Cite this