DM
2002
13 years 4 months ago
2002
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 subgr...