论文信息 - Nordhaus-Gaddum bounds for independent domination - 字舞流文

Nordhaus-Gaddum bounds for independent domination

We establish sharp bounds on the sum and product of the independent domination numbers of a graph and its complement.

Wayne Goddard | Michael A. Henning

[1] Frank Harary,et al. Nordhaus-Gaddum inequalities for domination in graphs , 1996, Discret. Math..

[2] Ernest J. Cockayne,et al. On a Nordhaus-Gaddum type problem for independent domination , 1995, Discret. Math..

[3] G. Chartrand. Graphs and Digraphs, Fourth Edition , 2004 .

[4] Preben Dahl Vestergaard,et al. Inequalities for total matchings of graphs , 1995 .

[5] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[6] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.

[7] Ernest J. Cockayne,et al. On the product of upper irredundance numbers of a graph and its complement , 1989, Discret. Math..

[8] Wayne Goddard,et al. A note on cliques and independent sets , 1997, J. Graph Theory.