Title of article
Domination in distance-hereditary graphs Original Research Article
Author/Authors
Maw-Shang Chang، نويسنده , , Shaur-Ching Wu، نويسنده , , Gerard J. Chang، نويسنده , , Hong-Gwa Yeh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
11
From page
103
To page
113
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.
Keywords
Labeling , Leaf , Distance-hereditary graph , Domination , Neighborhood , Twin
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885332
Link To Document