R-domination on block graphs
Journal
Operations Research Letters
Journal Volume
1
Journal Issue
6
Pages
214-218
Date Issued
1982
Author(s)
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. © 1982.
SDGs
Type
journal article