Independent dominating sets in triangle-free graphs |
| |
| Authors: | Wayne Goddard Jeremy Lyle |
| |
| Affiliation: | 1. School of Computing and Department of Mathematical Sciences, Clemson University, Clemson, SC, USA
2. Department of Mathematics, The University of Southern Mississippi, Hattiesburg, MS, USA
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
