Highly Influenced

# R-Domination in Graphs

@article{Slater1976RDominationIG, title={R-Domination in Graphs}, author={Peter J. Slater}, journal={J. ACM}, year={1976}, volume={23}, pages={446-450} }

- Published 1976 in J. ACM
DOI:10.1145/321958.321964

The problem of finding a minimum <italic>k</italic>-basis of graph <italic>G</italic> is that of selecting as small a set <italic>B</italic> of vertices as possible such that every vertex of <italic>G</italic> is at distance <italic>k</italic> or less from some vertex in <italic>B</italic>. Cockayne, Goodman, and Hedetniemi previously developed a linear algorithm to find a minimum 1-basis (a minimum dominating set) when <italic>G</italic> is a tree. In this paper the <italic>k</italic>-basis… CONTINUE READING