Abstract
We establish sharp bounds on the sum and product of the independent domination numbers of a graph and its complement.
| Original language | English |
|---|---|
| Pages (from-to) | 299-302 |
| Number of pages | 4 |
| Journal | Discrete Mathematics |
| Volume | 268 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 6 Jul 2003 |
| Externally published | Yes |
Keywords
- Complement
- Domination
- Independence
- Nordhaus-Gaddum
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics