论文信息 - Independent dominating sets in triangle-free graphs

Independent dominating sets in triangle-free graphs

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.

Wayne Goddard | Jeremy Lyle

[1] Julie Haviland. A note on independent domination in graphs of girth 6 , 2008, Australas. J Comb..

[2] Xue-Gang Chen,et al. Triangle-free graphs with large independent domination number , 2010, Discret. Optim..

[3] Changping Wang. The independent domination number of maximal triangle-free graphs , 2008, Australas. J Comb..

[4] Jacques Verstraëte,et al. Independent dominating sets in graphs of girth five , 2020, Comb. Probab. Comput..

[5] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[6] Julie Haviland. Upper bounds for independent domination in regular graphs , 2007, Discret. Math..

[7] Julie Haviland. Independent domination in triangle-free graphs , 2008, Discret. Math..