R-domination on block graphs

  • Authors:

  • Gerard J Chang;George L Nemhauser

  • Affiliations:

  • School of Operations Research and Industrial Engineering, College of Engineering, Upson Hall, Cornell University, Ithaca, NY 14853, U.S.A.;School of Operations Research and Industrial Engineering, College of Engineering, Upson Hall, Cornell University, Ithaca, NY 14853, U.S.A.

  • Venue:
  • Operations Research Letters
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

The k-domination problem is to select a minimum cardinality vertex set D of a graph G such that every vertex of G is within distance k from some vertex of D. We consider a generalization of the k-domination problem, called the R-domination problem. A linear algorithm is presented that solves this problem for block graphs. Our algorithm is a generalization of Slater's algorithm [12], which is applicable for forest graphs.