\(i\gamma(1)\)-perfect graphs (Q5936058)

A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). A set \(S\subseteq V(G)\) is independent in \(G\), if no two vertices of \(S\) are adjacent in \(G\). The minimum number of vertices of a dominating set in \(G\) is the domination number \(\gamma(G)\) of \(G\). The minimum number of vertices of a set which is simultaneously dominating and independent in \(G\) is the independent domination number \(i(G)\) of \(G\). For a positive integer \(k\) the symbol \(i\gamma(k)\) denotes the hereditary class of graphs that consists of all graphs \(G\) such that \(i(H)- \gamma(H)\leq k\) for every induced subgraph \(H\) of \(G\). The graphs from \(i\gamma(1)\) are a generalization of the domination perfect graphs; they are called \(i\gamma(1)\)-perfect graphs. In the paper they are characterized by means of forbidden induced subgraphs.