An induced subgraph characterization of domination perfect graphs

Abstract

Let y(G) and L(G) be the domination number and independent domination number of a graph G, respectively. A graph G is called domination perfect if y(H) = L ( H ) , for every induced subgraph H of G.There are many results giving a partial characterization of domination perfect graphs. In this paper, w e present a finite induced subgraph characterization of the entire class of domination perfect graphs. The list of forbidden subgraphs in the characterization 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. 0 1995 John Wiley & Sons, Inc. BASIC TERMINOLOGYAll graphs will be finite and undirected, without loops or multiple edges. If G is a graph, V ( G ) denotes the set, and IGl the number, of vertices in G. We will denote the neighborhood of a vertex x by N ( x ) . More generally, N(X) = UxtX N ( x ) for X V ( G ) . We will write x l X (x 4 ' X) to indicate that a vertex x is adjacent to all vertices (no vertex) of X C V ( G ) . For a set of vertices X, (X) denotes the subgraph of G induced by X . N ( X ) U X. In particular, if X dominates V ( G ) , then X is called a dominating set of G . An independent dominating set is a vertex subset that is both independent and dominating, or equivalently, is maximal independent. The domination Journal of Graph Theory, Vol. 20, No. 3, 375-395 (1995) If X, Y are subsets of V ( G ) , then X dominates Y if Y

Optimality Program in Segment and String Graphs

“…Although the NP-hardness of the aforementioned problems is known for segment intersection graphs [8,42], getting such linear reductions might be difficult.…”

α-Domination perfect trees

“…Among the deepest results in classical domination theory [5] is the characterization of domination perfect graphs in terms of their minimally forbidden induced subgraphs proved by Zverovich and Zverovich [9]. In the present paper we initiate the study of a similarly defined class of 'perfect' graphs using the concept of -domination that has recently been introduced by Dunbar et al [3].…”

Proof of a conjecture on irredundance perfect graphs

“…The related classes of graphs such as domination perfect graphs, upper domination perfect graphs and upper irredundance perfect graphs are studied as well. For a short survey on domination perfect graphs, see [15], and for a short survey on upper domination perfect graphs and upper irredundance perfect graphs, see [16]. While the irredundance and domination numbers are equal for irredundance perfect graphs, this is not the case in general.…”