The k-neighbor domination problem

The k-neighbor domination problem

0.00 Avg rating0 Votes
Article ID: iaor1993616
Country: Netherlands
Volume: 52
Issue: 3
Start Page Number: 373
End Page Number: 377
Publication Date: Jun 1991
Journal: European Journal of Operational Research
Authors: ,
Keywords: computational analysis, location
Abstract:

As a model of certain location problem, the authors consider the following domination problem. The k-neighbor domination problem is to select a minimum cardinality vertex set D of a graph G=(V,E) such that every vertex x not in D is adjacent to at least k vertices in D. This paper presents a linear algorithm to solve the problem for block graphs. For any fixed k, the authors also prove that the k-neighbor domination problem is NP-complete for some classes of graphs.

Reviews

Required fields are marked *. Your email address will not be published.