Generalized domination and efficient domination in graphs

Discrete Mathematics

Volumn 159, Issue 1-3, 1996, Pages 1-11

  Bange, D W ^a   Barkauskas, A E ^a   Host, L H ^a   Slater, P J ^b  

^a UNIVERSITY OF WISCONSIN LA CROSSE   (United States)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038551149     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00094-D     Document Type: Article

References (9)

1. D.W. Bange, A.E. Barkauskas and P.J. Slater, Disjoint dominating sets in trees, Sandia Laboratories Report, SAND 78-1087J, 1978.
2. D.W. Bange, A.E. Barkauskas and P.J. Slater, Efficient dominating sets in graphs, Applications of Discrete Mathematics (SIAM, Philadelphia, 1988), 189-199.
3. J. Dunbar, S.T. Hedetniemi, M.A. Henning and A. McRae, Minus domination in graphs, Computers Math. Appl., to appear
4. J. Dunbar, S.T. Hedetniemi, M.A. Henning and P.J. Slater, Signed domination in graphs, eds. Y. Alavi and A. Schwenk, Graph theory, Combinatorics, and Applications, (Wiley, New York, 1995) 311-321.
5. M. Farber, Domination, independent domination, and duality in strongly chordal graphs, Discrete Appl. Math. 7 (1984) 115-130.
6. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco, 1979).
7. D.L. Grinstead and P.J. Slater, Fractional domination and fractional packing in graphs, Congr. Numer. 71 (1990) 153-172.
8. S.M. Hedetniemi, S.T. Hedetniemi and T.V. Wimer, Linear time resource allocation for trees, manuscript.
9. A. McRae, personal correspondence.