Average distance and domination number revisited

作者：Rautenbach Dieter^*

来源：Discrete Applied Mathematics, 2011, 159(11): 1180-1182.

DOI：10.1016/j.dam.2011.03.015

• Average distance
• Domination number

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].

• 出版日期2011-7-6