Document Type

Article

Publication Date

1-1-2012

Department

Mathematics

School

Mathematics and Natural Sciences

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.

Comments

This is the peer reviewed version of the following article: "Independent Dominating Sets In Triangle-Free Graphs," which has been published in final form at 10.1007/s10878-010-9336-4.

Publication Title

Journal of Combinatorial Optimization

Volume

23

Issue

1

First Page

9

Last Page

20

Download

Find in your library

Share

COinS