Domination in distance-hereditary graphs
檔案
- 000173568800006.pdf (108.1 KB, Adobe PDF)
日期
2002-01-15
類型
系所
期刊名稱
DISCRETE APPLIED MATHEMATICS
卷期與頁次
第 116 卷第 1-2 期,頁 103–113
ISSN
0166-218X
語言
英文
摘要
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. (C) 2002 Elsevier Science B.V. All rights reserved.