Title of article
A note on dominating sets and average distance
Author/Authors
DeLaViٌa، نويسنده , , Ermelinda and Pepper، نويسنده , , Ryan and Waller، نويسنده , , Bill، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
2615
To page
2619
Abstract
We show that the total domination number of a simple connected graph is greater than the average distance of the graph minus one-half, and that this inequality is best possible. In addition, we show that the domination number of the graph is greater than two-thirds of the average distance minus one-third, and that this inequality is best possible. Although the latter inequality is a corollary to a result of P. Dankelmann, we present a short and direct proof.
Keywords
average distance , Domination number , Wiener index , Total domination number
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598742
Link To Document