Irredundance perfect graphs (Q1896349)

Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\). A vertex \(x\in X\) is redundant in \(X\) if \(N[x]\subseteq N[X- \{x\}]\). A set containing no redundant vertex is called irredundant. The smallest cardinality amongst all maximal irredundant sets of \(G\) is called the irredundance number of \(G\) and is denoted by \(\text{ir}(G)\). It is well known that \(\text{ir}(G)\leq \gamma(G)\) for all graphs \(G\). A graph \(G\) is said to be irredundance perfect if \(\text{ir}(G)= \gamma(H)\) for all induced subgraphs \(H\) of \(G\). The author characterizes all those graphs \(G\) for which \(\text{ir}(H)= \gamma(H)\) for every induced subgraph \(H\) of \(G\) with \(\text{ir}(H)= 2\) using 30 induced forbidden subgraphs. Moreover, the author establishes a sufficient condition for a graph \(G\) with \(\text{ir}(G)\leq 4\) to satisfy \(\text{ir}(G)=\gamma(G)\) in terms of three forbidden subgraphs. This result strengthens a conjecture due to Favaron (1986) which states that if a graph \(G\) does not contain these three forbidden subgraphs, then \(\text{ir}(G)= \gamma(G)\).