Average distance and domination number revisited

We give a short proof for Dankelmann’s characterization of connected graphs of given order and domination number that maximize the average distance [P. Dankelmann, Average distance and the domination number, Discrete Appl. Math. 80 (1997) 21–35].