Average eccentricity in k-connected tournaments

arXiv:2610.35970 · math.CO · Submitted 2026-10-26 · Read on arXiv

math.CO

Submitted: 2026-10-26

Updated: 2026-10-26

License: http://creativecommons.org/licenses/by/4.0/

The gist: The average eccentricity (D) of a strong digraph D is the mean eccentricity of all vertices in D.

Abstract

The average eccentricity (D) of a strong digraph D is the mean eccentricity of all vertices in D. A tournament T is an orientation of a complete graph. In this paper, we prove that the average eccentricity satisfies 2 at most (T) < n over 2k + 11 over 2 + k over 8n for a k-connected tournament T of order n. We further examine the case for strong tournaments where k = 1, and show that (T) at most n+11 over 2 + 1 over 8n for any strong tournament T. Moreover, we show that the lower bound 2 is sharp and that the upper bounds are best possible apart from an additive constant.

Related papers