An induced subgraph characterization of domination perfect graphs
Igor E. Zvervich, Vadim E. Zverovich · Journal of Graph Theory · 1995
Abstract Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G). There are many results giving a partial characterization of domination perfect graphs. In this paper, we present a finite induced subgraph characterization of the entire class of domination perfect graphs. The list of forbidden subgraphs in the charcterization consists of 17 minimal domination imperfect graphs. Moreover, the dominating set and independent dominating set problems are shown to be both NP‐complete on some classes of graphs. © 1995 John Wiley & Sons, Inc.