Title of article
Average distance and domination number revisited
Author/Authors
Dieter Rautenbach، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
3
From page
1180
To page
1182
Abstract
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].
Keywords
Average distance , Domination number
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887664
Link To Document