An algorithm to find two distance domination parameters in a graph

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 85-91

  Fricke, Gerd H ^a   Henning, Michael A ^b   Oellermann, Ortrud R ^c   Swart, Henda C ^b  

^a WRIGHT STATE UNIVERSITY   (United States)

^b UNIVERSITY OF KWAZULU NATAL   (South Africa)

^c BRANDON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. R.B. Allan, R. Laskar and S.T. Hedetniemi, A note on total domination, Discrete Math. 49 (1984) 7-13.
2. 5-free graphs, Periodi. Math. Hungar. 21 (1990) 303-308.
3. G. Bascó and Z. Tuza, A characterization of graphs without long induced paths, J. Graph Theory 14 (1990) 455-464.
4. L. Beineke and M.A. Henning, Some extremal results on independent distance domination in graphs, Ars. Combin., to appear.
5. J.A. Bondy and G. Fan, A sufficient condition for dominating cycles, Discrete Math. 76 (1987) 205-208.
6. G.J. Chang, k-domination and graph covering problems, Ph.D. Thesis, School of OR and IE, Cornell University, Ithaca, NY (1982).
7. G.J. Chang and G.L. Nemhauser, R-domination of block graphs, Oper. Res. Lett. 1(6) (1982) 214-218.
8. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problem on graphs, Tech. Report 540, School of Operations Res. and Industrial Eng., Cornell Univ., (1982).
9. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sunfree chordal graphs, SIAM J. Algebraic Discrete Methods 5(3) (1984) 332-345.
10. G. Chartrand and L. Lesniak, Graphs and Digraphs, (Wadsworth and Brooks/Cole, Monterey, CA, 2nd ed., 1986).
11. P. Fraisse, A note on distance dominating cycles, Discrete Math. 71(1) (1988) 89-92.
12. G. Fricke, S.T. Hedetniemi and M.A. Henning, Distance independent domination in graphs, Ars Combin., to appear.
13. G. Fricke, S.T. Hedetniemi and M.A. Henning, Asymptotic results on distance independent domination in graphs, J. Combin. Math. Combin. Comput., to appear.
14. J.H. Hattingh and M.A. Henning, A characterization of block graphs that are well-k-dominated, J. Combin. Math. Combin. Comput. 13 (1993) 33-38.
15. J.H. Hattingh and M.A. Henning, The ratio of the distance irredundance and domination numbers, J. Graph Theory 18 (1994) 1-9.
16. M.A. Henning, O.R. Oellermann System and H.C. Swart, Bounds on distance domination parameters, J. Combin. Inform. System Sci. 16 (1991) 11-18.
17. M.A. Henning, O.R. Oellermann and H.C. Swart, Relationships between distance domination parameters, Math. Pannon. 5(1) (1994) 69-79.
18. M.A. Henning, O.R. Oellermann and H.C. Swart, Relating pairs of distance domination parameters, in J. Combin. Math. Combin. Comput, to appear.
19. M.A. Henning, O.R. Oellermann and H.C. Swart, Distance domination critical graphs, J. Combin. Sci., Inform. System to appear.
20. M.A. Henning, O.R. Oellermann and H.C. Swart, The diversity of domination, Discrete Math., to appear.
21. A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree, Pacific J. Math. 61 (1975) 225-233.
22. Z. Mo and K. Williams, (r, s)-domination in graphs and directed graphs, Ars. Combin. 29 (1990) 129-141.
23. P.J. Slater, R-domination in graphs, J. A.C.M. 23 (1976) 446-450.
24. J. Topp and L. Volkmann, On packing and covering numbers of graphs, Discrete Math. 96 (1991) 229-238.
25. Xin He and Y. Yesha, Efficient parallel algorithms for r-dominating set and p-center problems on trees, Algorithmica 5 (1990) 129-145.