Nordhaus-Gaddum bounds for independent domination

Discrete Mathematics

Volumn 268, Issue 1-3, 2003, Pages 299-302

  Goddard, Wayne ^a   Henning, Michael A ^a  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

Author keywords

Complement; Domination; Independence; Nordhaus Gaddum

Indexed keywords

EID: 84867967632     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00032-3     Document Type: Article

References (7)

1. G. Chartrand, L. Lesniak, Graphs and Digraphs, Third Edition, Chapman & Hall, London, 1996.
2. E.J. Cockayne, G. Fricke, C.M. Mynhardt, On a Nordhaus-Gaddum type problem for independent domination, Discrete Math. 138 (1995) 199-205.
3. E.J. Cockayne, C.M. Mynhardt, On the product of upper irredundance numbers of a graph and its complement, Discrete Math. 76 (1989) 117-121.
4. R.C. Entringer, W. Goddard, M.A. Henning, A note on cliques and independent sets, J. Graph Theory 24 (1997) 21-23.
5. J. Gimbel, P. Vestergaard, Inequalities for total matchings of graphs, Ars Combin. 39 (1995) 109-119.
6. F. Harary, T.W. Haynes, Nordhaus-Gaddum inequalities for domination in graphs, Discrete Math. 155 (1996) 99-105.
7. T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel-Dekker, New York, 1998.