Upper domination and upper irredundance perfect graphs
(1998)
Journal Article
Gutin, G., & Zverovich, V. (1998). Upper domination and upper irredundance perfect graphs. Discrete Mathematics, 190(1-3), 95-105. https://doi.org/10.1016/S0012-365X%2898%2900036-3
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H)... Read More about Upper domination and upper irredundance perfect graphs.