Abstract
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).
Original language | English (US) |
---|---|
Pages (from-to) | 261-266 |
Number of pages | 6 |
Journal | Discrete Mathematics |
Volume | 188 |
Issue number | 1-3 |
DOIs | |
State | Published - Jun 28 1998 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics