Proof of a conjecture on irredundance perfect graphs
(2002)
Journal Article
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this article we present a result which immediately imp... Read More about Proof of a conjecture on irredundance perfect graphs.