| Article ID: | iaor2012234 |
| Volume: | 23 |
| Issue: | 1 |
| Start Page Number: | 9 |
| End Page Number: | 20 |
| Publication Date: | Jan 2012 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Goddard Wayne, Lyle Jeremy |
| Keywords: | combinatorial optimization |
The independent domination number of a graph is the smallest cardinality of an independent set that dominates the graph. In this paper we consider the independent domination number of triangle‐free graphs. We improve several of the known bounds as a function of the order and minimum degree, thereby answering conjectures of Haviland.