Abstract
We give a sharp upper bound on the average distance of a graph of given order and domination number and determine the extremal graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 21-35 |
| Number of pages | 15 |
| Journal | Discrete Applied Mathematics |
| Volume | 80 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 5 Dec 1997 |
| Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics