| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649798 | Discrete Mathematics | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ermelinda DeLaViña, Ryan Pepper, Bill Waller,