A NOTE ON THE CHARACTERIZATION OF DOMINATION PERFECT GRAPHS

被引：21

作者：

FULMAN, J

机构：

[1] Department of Mathematics, Harvard University, Cambridge, Massachusetts

来源：

JOURNAL OF GRAPH THEORY | 1993年 / 17卷 / 01期

关键词：

D O I：

10.1002/jgt.3190170106

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is domination perfect if for each induced subgraph H of G, gamma(H) = i(H), where gamma and i are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced charaCtErization of domination perfect graphs. This characterization is not correct, but the ideas in [3] can be used to weaken the known sufficient conditions for a graph to be domination perfect and to obtain short proofs of some results regarding domination perfect graphs.

引用

页码：47 / 51

页数：5