Independent dominating sets in triangle-free graphs

被引：0

作者：

Wayne Goddard

Jeremy Lyle

机构：

[1] Clemson University,School of Computing and Department of Mathematical Sciences

[2] The University of Southern Mississippi,Department of Mathematics

来源：

Journal of Combinatorial Optimization | 2012年 / 23卷

关键词：

Dominating sets; Independent domination; Triangle-free;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：9 / 20

页数：11

共 9 条

[1]

Haviland J(2007)Upper bounds for independent domination in regular graphs Discrete Math 307 2643-2646

[2]

Haviland J(2008)Independent domination in triangle-free graphs Discrete Math 308 3545-3550

[3]

Haviland J(2008)A note on independent domination in graphs of girth 5 Australas J Combin 40 301-304

[4]

Haviland J(2008)A note on independent domination in graphs of girth 6 Australas J Combin 42 171-175

[5]

Kim JH(1995)The Ramsey number Random Structures Algorithms 7 173-207

[6]

Shiu WC(2010)(3, Discrete Optim 7 86-92

[7]

Chen XG(2008)) has order of magnitude Australas J Combin 42 129-136

[8]

Chan WH(undefined)/log undefined undefined undefined-undefined

[9]

Wang C(undefined)Triangle-free graphs with large independent domination number undefined undefined undefined-undefined

← 1 →