The algorithmic complexity of minus domination in graphs

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 73-84

  Dunbar, Jean ^a   Goddard, Wayne ^b   Hedetniemi, Stephen ^c   McRac, Alice ^c   Henning, Michael A ^b  

^a Department of Psychology   (United States)

^b UNIVERSITY OF KWAZULU NATAL   (South Africa)

^c South   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013174601     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00056-W     Document Type: Article

References (8)

1. K.S. Booth, Dominating sets in chordal graphs, Research Report CS-80-34, University of Waterloo, 1980.
2. K.S. Booth and J.H. Johnson, Dominating sets in chordal graphs, SIAM J. Comput. 11 (1982) 191-199.
3. G. Chartrand and L. Lesniak, Graphs and Digraphs, Second Edition (Wadsworth and Brooks/Cole, Monterey, CA, 1986).
4. E.J. Cockayne, O. Favaron, C. Payan and A. Thomason, Contributions to the theory of domination, independence and irredundance in graphs, Discrete Math. 33 (1981) 249-258.
5. A.K. Dewdney, Fast Turing reductions between problems in NP 4, Report 71, University of Western Ontario, 1981.
6. J. Dunbar, S.T. Hedetniemi, M.A. Henning and A. McRae, Minus domination in graphs, Comput. Math. Appl., to appear.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
8. M.S. Jacobson and K. Peters, Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86 (1990) 59-69.