On αrγs(k)-perfect graphs

For some integer k0 and two graph parameters π and τ, a graph G is called πτ(k)-perfect, if π(H)−τ(H)k for every induced subgraph H of G. For r1 let α_r and γ_r denote the r-(distance)-independence and r-(distance)-domination number, respectively. In (J. Graph Theory 32 (1999) 303–310), I. Zverovich gave an ingenious complete characterization of α₁γ₁(k)-perfect graphs in terms of forbidden induced subgraphs. In this paper we study α_rγ_s(k)-perfect graphs for r,s1. We prove several properties of minimal α_rγ_s(k)-imperfect graphs. Generalizing Zverovich's main result in (J. Graph Theory 32 (1999) 303–310), we completely characterize α_2r−1γ_r(k)-perfect graphs for r1. Furthermore, we characterize claw-free α₂γ₂(k)-perfect graphs.