A Characterization of $P_6$-Free Irredundance Perfect Graphs

Vadim Zverovich, Pavel Skums, Lutz Volkmann

Let $ir(G)$ and $\gamma (G)$ be the irredundance number and the domination number of a graph $G$, respectively. A graph $G$ is called irredundance perfect if $ir(H)=\gamma (H)$ for every induc…