Domination in distance-hereditary graphs
Journal
Discrete Applied Mathematics
Journal Volume
116
Journal Issue
1-2
Pages
103-113
Date Issued
2002
Author(s)
Abstract
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case. © 2002 Elsevier Science B.V.
Type
journal article